Problem: We have a graph with N vertices and M edges, and there are two people on the graph: Takahashi and Aoki.

The i-th edge connects Vertex U_i and Vertex V_i. The time it takes to traverse this edge is D_i minutes, regardless of direction and who traverses the edge (Takahashi or Aoki).

Takahashi departs Vertex S and Aoki departs Vertex T at the same time. Takahashi travels to Vertex T and Aoki travels to Vertex S, both in the shortest time possible. Find the number of the pairs of ways for Takahashi and Aoki to choose their shortest paths such that they never meet (at a vertex or on an edge) during the travel, modulo 10^9 + 7.

Constraints

* 1 \leq N \leq 100 000
* 1 \leq M \leq 200 000
* 1 \leq S, T \leq N
* S \neq T
* 1 \leq U_i, V_i \leq N (1 \leq i \leq M)
* 1 \leq D_i \leq 10^9 (1 \leq i \leq M)
* If i \neq j, then (U_i, V_i) \neq (U_j, V_j) and (U_i, V_i) \neq (V_j, U_j).
* U_i \neq V_i (1 \leq i \leq M)
* D_i are integers.
* The given graph is connected.

Input

Input is given from Standard Input in the following format:


N M
S T
U_1 V_1 D_1
U_2 V_2 D_2
:
U_M V_M D_M


Output

Print the answer.

Examples

Input

4 4
1 3
1 2 1
2 3 1
3 4 1
4 1 1


Output

2


Input

3 3
1 3
1 2 1
2 3 1
3 1 2


Output

2


Input

8 13
4 2
7 3 9
6 2 3
1 6 4
7 6 9
3 8 9
1 2 2
2 8 12
8 6 9
2 5 5
4 2 18
5 3 7
5 1 515371567
4 8 6


Output

6

Solution (in CPP):

Solution:
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1LL << 55)
#define MOD (1000LL * 1000 * 1000 + 7)
#define maxn 200111

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;

vector<pll> adj[maxn];
ll dps[maxn], dpt[maxn], froms[maxn], fromt[maxn];
ll n, m, s, t;

void dijkstra(ll start, ll d[], ll dp[]){
	for(int i = 1; i <= n; i++){
		d[i] = INF;
		dp[i] = 0;
	}

	priority_queue<pll> pq;
	d[start] = 0;
	dp[start] = 1;
	pq.push(mp(0, start));
	while(!pq.empty()){
		ll x = pq.top().se;
		ll val = -pq.top().fi;
		pq.pop();

		if(val > d[x])
			continue;

		for(auto i : adj[x]){
			ll v = i.fi;
			ll cost = i.se;

			if(d[v] > d[x] + cost){
				d[v] = d[x] + cost;
				dp[v] = dp[x];
				pq.push(mp(-d[v], v));
				continue;
			}
			if(d[v] == d[x] + cost)
				dp[v] = (dp[v] + dp[x]) % MOD;
		}
	}

}

int main(){
	scanf("%lld%lld%lld%lld", &n, &m, &s, &t);
	for(int i = 0; i < m; i++){
		ll a, b, c;
		scanf("%lld%lld%lld", &a, &b, &c);
		adj[a].pb(mp(b, c));
		adj[b].pb(mp(a, c));
	}

	dijkstra(s, froms, dps);
	dijkstra(t, fromt, dpt);


	ll shortest_path = froms[t];
	ll all = (dps[t] * dps[t]) % MOD; // number of all shortest paths
	ll snode = 0;	// shortest paths that intersect at node
	ll sedge = 0; 	// shortest paths that intersect at edge
	
	for(ll i = 1LL; i <= n; i++){
		if(froms[i] == fromt[i] && froms[i] + fromt[i] == shortest_path)
			snode = (snode + dps[i] * dps[i] % MOD * dpt[i] % MOD * dpt[i] % MOD) % MOD;

		for(auto j : adj[i]){
			ll v = j.fi;
			ll cost = j.se;

			if(2 * froms[i] < shortest_path && 2 * fromt[v] < shortest_path && froms[i] + fromt[v] + cost == shortest_path)
				sedge = (sedge + dps[i] * dps[i] % MOD * dpt[v] % MOD * dpt[v] % MOD) % MOD;
		}
	}

	printf("%lld\n", (all - snode - sedge + 3 * MOD) % MOD);	
	return 0;
}