#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
struct ver{
int id,type,dist;
bool operator >(const ver&w)const
{
return dist>w.dist;
}
};
const int N=1010,M=20010;
int h[N],e[M],ne[M],w[M],idx;
int dist[N][2],cnt[N][2];
bool st[N][2];
int cases,n,m;
int S,F;
void add(int a,int b,int c)
{
e[idx]=b;
ne[idx]=h[a];
w[idx]=c;
h[a]=idx++;
}
int dijstra()
{
memset(dist,0x3f,sizeof dist);
memset(st,0,sizeof st);
memset(cnt,0,sizeof cnt);
dist[S][0]=0;
// dist[S][1]=1;
cnt[S][0]=1;
priority_queue<ver,vector<ver>,greater<ver>> heap;
heap.push({S,0,0});
while(heap.size())
{
auto t=heap.top();
heap.pop();
int id=t.id,type=t.type,distance=t.dist,count=cnt[id][type];
if(st[id][type]) continue;
st[id][type]=true;
for(int i=h[id];~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]=count;
heap.push({j,1,dist[j][1]});
heap.push({j,0,dist[j][0]});
}
else if(dist[j][0]==distance+w[i])
cnt[j][0]+=count;
else if(dist[j][1]>distance+w[i])
{
dist[j][1]=distance+w[i];
cnt[j][1]=count;
heap.push({j,1,dist[j][1]});
}
else if(dist[j][1]==distance+w[i])
cnt[j][1]+=count;
}
}
if(dist[F][1]==dist[F][0]+1) return cnt[F][0]+cnt[F][1];
return cnt[F][0];
}
int main()
{
scanf("%d",&cases);
while(cases--)
{
memset(h,-1,sizeof h);
idx=0;
scanf("%d%d",&n,&m);
while(m--)
{
int a,b,c;
cin>>a>>b>>c;
add(a,b,c);
}
scanf("%d%d",&S,&F);
printf("%d\n",dijstra());
}
return 0;
}