次短路记数

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5+10;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;

int n,q,m;

int e[N],ne[N],w[N],h[N],idx;
void add(int a,int b,int c){
	e[idx] = b,ne[idx] = h[a],w[idx] = c,h[a] = idx++;
}

int cnt[N][2];
int dist[N][2];
bool vis[N][2];

struct Node{
	int distance,ver,type;
	bool operator<(const Node&W)const{
		return distance>W.distance;
	}
};


void dijk()
{
	priority_queue<Node>heap;
	int st,ed;
	cin>>st>>ed;
	memset(cnt,0,sizeof cnt);
	memset(dist,0x3f,sizeof dist);
	memset(vis,0,sizeof vis);
	dist[st][0] = 0;
	cnt[st][0] = 1;
	
	heap.push({0,st,0});
	
	
	while(heap.size()){
		auto t = heap.top();
		heap.pop();
		int distance = t.distance,ver = t.ver,type = t.type;
		//cout<<ver<<"\n";
		//cout<<cnt[ver][type]<<"gaga\n";
		if(vis[ver][type])continue;
		vis[ver][type] = true;
		
		for(int i=h[ver];~i;i=ne[i]){
			int j = e[i];
			if(dist[j][0]>distance+w[i]){
				dist[j][1] = dist[j][0],cnt[j][1] = cnt[j][0];
				dist[j][0] = distance+w[i],cnt[j][0] = cnt[ver][type];
				heap.push({dist[j][0],j,0});
				heap.push({dist[j][1],j,1});
			}else if(dist[j][0]==distance+w[i]){
				cnt[j][0]+=cnt[ver][type];
			}else if(dist[j][1]>distance+w[i]){
				dist[j][1] = distance+w[i],cnt[j][1] = cnt[ver][type];
				heap.push({dist[j][1],j,1});
			}else if(dist[j][1]==distance+w[i]){
				cnt[j][1] += cnt[ver][type];
			}
		}
		
	}
	
	
	int res = cnt[ed][0];
	if(dist[ed][1]==dist[ed][0]+1)res+=cnt[ed][1];
	cout<<res<<"\n";
	//cout<<"\n";
}



void solve()
{
	cin>>n>>m;
	memset(h,-1,sizeof h);idx = 0;
	
	while(m--){
		int a,b,c;cin>>a>>b>>c;
		add(a,b,c);
	}
	
	dijk();
	

}

signed main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int _;
	cin>>_;
	//_ = 1;
	while(_--)solve();
	return 0;
}