#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <unordered_set>
#include <unordered_map>
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 
#include <random>
#include <chrono>

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>
#include <climits>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define ULL unsigned long long
#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VLL vector <LL>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >
#define SI set < int >
#define USI unordered_set <int>
#define MII map <int, int>
#define UMII unordered_map <int, int>
#define MS multiset
#define US unordered_set
#define UM unordered_map
#define UMS unordered_multiset
#define UMM unordered_multimap

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()
#define INS insert
#define ER erase
#define CNT count

const LL INF = 1e18;
const int MOD  = 1e9 + 7;

int n, m, source, dest;
vector <VPII> g;
VLL dist, dist2, cnt, cnt2;
stack<int> order;
VB was;

void dijkstra(int start, VLL &d)
{
	set < pair <LL, int > > pq;
	d.RS(n + 1, INF);
	d[start] = 0;
	pq.INS({0, start});
	while (!pq.empty())
	{
		auto [dnode, node] = *pq.BG;
		pq.ER(pq.BG);
		for (auto [next, cost] : g[node])
			if (d[next] > dnode + cost)
			{
				pq.ER({d[next], next});
				d[next] = dnode + cost;
				pq.INS({d[next], next});
			}
	}
}

void df(int node, VLL &d)
{
	was[node] = true;
	for (auto [next, cost] : g[node])
		if (!was[next] && d[node] + cost == d[next]) df(next, d);
	order.push(node);
}

void topsort(int start, VLL &d, VLL &c)
{
	was.CL, was.RS(n + 1);
	FOR(i, 1, n)
		if (!was[i]) df(i, d);
	c.RS(n + 1);
	c[order.top()] = 1;
	while (!order.empty())
	{
		int node = order.top();
		order.pop();
		for (auto [next, cost] : g[node])
			if (d[node] + cost == d[next]) c[next] = (c[next] + c[node]) % MOD;
	}
}

int main()
{
	cin >> n >> m;
	g.RS(n + 1);
	FOR(i, 1, m)
	{
		int x, y, z;
		cin >> x >> y >> z;
		g[x].PB({y, z});
		g[y].PB({x, z});
	}
	cin >> source >> dest;
	dijkstra(source, dist);
	dijkstra(dest, dist2);
	topsort(source, dist, cnt);
	topsort(dest, dist2, cnt2);
	LL half = dist[dest] / 2;
	LL sum = 0;
	int p = 0;
	FOR(i, 1, n)
	{
		if (dist[i] == half && dist2[i] == half) 
		{
			sum = (sum + cnt[i] * cnt2[i]) % MOD;
			++p;
		}
		for (auto [next, cost] : g[i])
		{
			if (i > next) continue;
			if (dist[i] + dist2[next] + cost != dist[dest]) continue;
			if (dist[i] + cost > dist2[next] && dist2[next] + cost > dist[i])
			{
				sum = (sum + cnt[i] * cnt2[next]) % MOD;
				++p;
			}
		}
	}

	sum = (sum * (p - 1)) % MOD;
	cout << sum;

	return 0;
}