#include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using ll=long long;

const int maxn=50005,z=INT_MAX,M=1e9+7;
vector<int> dd(maxn+1,z),dn(maxn+1,z),cd(maxn+1),cn(maxn+1);
vector<pii> adj[maxn+1];

void dijkstra(set<pii>& s,vector<int>& d,vector<int>& c){
    while(!s.empty()){
        auto [vw,v]=*s.begin();
        s.erase(s.begin());
        if(vw!=d[v])continue;
        for(auto[to,w]:adj[v]){
            if(d[to]>d[v]+w) {
                d[to]=d[v]+w;
                c[to]=c[v];
                s.insert({d[to],to});  
            }else if(d[to]==d[v]+w) {
                c[to]+=c[v];
            }
        }
    }
}

int main(){
    int n,m;cin>>n>>m;
    for(int i=0;i<m;i++){
        int a,b,c;cin>>a>>b>>c;
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
    }
    int dor,nor;cin>>dor>>nor;
    set<pii> s;
    s.insert({0,dor});
    dd[dor]=0;dn[nor]=0;
    cd[dor]=1;cn[nor]=1;
    dijkstra(s,dd,cd);
    set<pii> s2;
    s2.insert({0,nor});
    dijkstra(s2,dn,cn);
    int x=dd[nor];
    ll ans=1LL*cd[nor]*cd[nor];
    ll no=0;
    for(int i=1;i<=n;i++){
        if(dd[i]==x/2&&dn[i]==x/2)
            no=(no+1LL*cd[i]*cn[i]%M*cd[i]*cn[i]%M)%M;
    }
    for(int u=1;u<=n;u++){
        for(auto [v,w]:adj[u]){
            if(dd[v]+w+dn[u]==x&&abs(dd[v]-dn[u])<=w)
                no=(no+1LL*cd[v]*cn[u]%M*cd[u]*cn[u]%M)%M;
        }
    }
    cout<<(abs(ans-no))%M<<'\n';
}