#include <bits/stdc++.h>
#include <climits>
#include <queue>
using namespace std;
using ll=long long;
using pll=pair<ll, ll>;
const ll MOD=1e9+7;
const ll INF=LONG_LONG_MAX;

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n, m; cin >> n >> m;
    vector<vector<pll>> graph(n, vector<pll> ());
    for (ll i=0; i<m; i++){
        ll a, b, c; cin >> a >> b >> c; a--; b--;
        graph[a].push_back({b, c});
        graph[b].push_back({a, c});
    }
    ll a, b; cin >> a >> b; a--; b--;
    vector<ll> disA(n, INF);
    vector<ll> disB(n, INF);
    vector<ll> waysA(n, 0);
    vector<ll> waysB(n, 0);
    priority_queue<pll, vector<pll>, greater<pll>> pq;
    disA[a]=0;
    waysA[a]=1;
    pq.push({0, a});
    while (pq.size()>0){
        ll disCurr=pq.top().first, idParent=pq.top().second;
        pq.pop();
        if (disCurr!=disA[idParent]) continue;
        for (auto& [idChild, road]:graph[idParent]){
            if (disA[idChild]==disCurr+road)
                waysA[idChild]=(waysA[idChild]+waysA[idParent])%MOD;
            if (disA[idChild]>disCurr+road){
                disA[idChild]=disCurr+road;
                waysA[idChild]=waysA[idParent];
                pq.push({disA[idChild], idChild});
            }
        }
    }
    disB[b]=0;
    waysB[b]=1;
    pq.push({0, b});
    while (pq.size()>0){
        ll disCurr=pq.top().first, idParent=pq.top().second;
        pq.pop();
        if (disCurr!=disB[idParent]) continue;
        for (auto& [idChild, road]:graph[idParent]){
            if (disB[idChild]==disCurr+road)
                waysB[idChild]=(waysB[idChild]+waysB[idParent])%MOD;
            if (disB[idChild]>disCurr+road){
                disB[idChild]=disCurr+road;
                waysB[idChild]=waysB[idParent];
                pq.push({disB[idChild], idChild});
            }
        }
    }
    ll total=waysA[b]*waysA[b]%MOD;
    ll bad=0;
    for (ll i=0; i<n; i++){
        if (disA[i]*2==disA[b] && disA[i]==disB[i]){
            ll curr=waysA[i]*waysB[i]%MOD;
            bad+=curr*curr%MOD;
            bad%=MOD;
        }
    }
    for (ll i=0; i<n; i++){
        for (auto& [id, road]:graph[i]){
            if (disA[i]+road==disA[id] && disA[id]+disB[id]==disA[b] && disA[i]*2<disA[b] && disA[id]*2>disA[b]){
                ll curr=waysA[i]*waysB[id]%MOD;
                bad+=curr*curr%MOD;
                bad%=MOD;
            }
        }
    }
    cout << (total-bad+MOD)%MOD;
}