/*

  用Dijkstra更新2*n次，来更新出所有点的最短路和次短路，顺便更新方案数。

*/

#include<cstdio>

#include<iostream>

#include<cstring>

#define N 1010

#define INF 500000000

using namespace std;

int head[N],vis[N][],dis[N][],f[N][],n,m,s,t;

struct node{

    int v,pre,t;

};node e[N*];

void add(int i,int x,int y,int z){

    e[i].v=y;

    e[i].t=z;

    e[i].pre=head[x];

    head[x]=i;

}

void Dij()

{

    dis[s][]=;f[s][]=;

    for(int T=;T<=n*;T++){

        int minn=INF,pos=,flag;

        for(int i=;i<=n;i++){

            if(dis[i][]<minn&&!vis[i][]){

                minn=dis[i][];pos=i;flag=;

            }

            if(dis[i][]<minn&&!vis[i][]){

                minn=dis[i][];pos=i;flag=;

            }

        }

        if(!pos)break;

        vis[pos][flag]=;

        for(int i=head[pos];i;i=e[i].pre){

            int v=e[i].v;

            if(minn+e[i].t<dis[v][]){

                dis[v][]=dis[v][];

                f[v][]=f[v][];

                dis[v][]=minn+e[i].t;

                f[v][]=f[pos][flag];

            }

            else if(minn+e[i].t==dis[v][]){

                f[v][]+=f[pos][flag];

            }

            else if(minn+e[i].t<dis[v][]){

                dis[v][]=minn+e[i].t;

                f[v][]=f[pos][flag];

            }

            else if(minn+e[i].t==dis[v][]){

                f[v][]+=f[pos][flag];

            }

        }

    }

    if(dis[t][]==dis[t][]-)

        printf("%d\n",f[t][]+f[t][]);

    else

        printf("%d\n",f[t][]);

}

void work(){

    scanf("%d%d",&n,&m);

    for(int i=;i<=m;i++){

        int x,y,z;scanf("%d%d%d",&x,&y,&z);

        add(i,x,y,z);

    }

    scanf("%d%d",&s,&t);

    Dij();

}

int main(){

    int T;scanf("%d",&T);

    while(T--){

        memset(dis,/,sizeof(dis));

        memset(vis,,sizeof(vis));

        memset(f,,sizeof(f));

        memset(head,,sizeof(head));

        memset(e,,sizeof(e));

        work();

    }

    return ;

}