#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll INF=1e18;

const int M=2e3+;

ll dist[M];

struct node{

    int v,nextt;

    ll w;

}e[(M*M)<<];

int tot,vis[M],head[M],a[M],sign[M];

void addedge(int u,int v,ll w){

    e[tot].v=v;

    e[tot].nextt=head[u];

    e[tot].w=w;

    head[u]=tot++;

}

void spfa(int s)

{

    queue<int>q;

    while(!q.empty())

        q.pop();

    memset(dist,0x7f,sizeof dist);

    //cout<<dist[0]<<endl;

    memset(vis,false,sizeof vis);

    dist[s]=;

    vis[s]=true;

    q.push(s);

    while(!q.empty()) {

        int u=q.front();

        q.pop();

        vis[u]=false;

        for(int i=head[u];~i; i=e[i].nextt) {

            int v=e[i].v;

            if(dist[v]>dist[u]+e[i].w) {

                dist[v]=dist[u]+e[i].w;

                if(!vis[v]) {

                    vis[v]=true;

                    q.push(v);

                }

            }

        }

    }

}

int main(){

    int t;

    scanf("%d",&t);

    while(t--){

        int n,m,he,k,C,s=;

        scanf("%d%d%d%d%d",&n,&m,&he,&k,&C);

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

            head[i]=-,sign[i]=;

        tot=;

        for(int i=;i<=k;i++)

            scanf("%d",&a[i]),sign[a[i]]=;

        while(m--) {

            int u,v;

            ll w;

            scanf("%d%d%lld",&u,&v,&w);

            addedge(u,v,w);

            addedge(v,u,w);

        }

        spfa(he);

        ll maxxhe=0ll;

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

            maxxhe=max(maxxhe,dist[i]);

        for(int i=;i<=k;i++)

            addedge(s,a[i],);

        spfa(s);

        ll maxxren=0ll;

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

            if(sign[i]==)

                maxxren=max(dist[i],maxxren);

        }

        maxxren*=1ll*C;

    //    cout<<maxxhe<<"!!"<<maxxren<<endl;

        if(maxxhe<=maxxren){

            printf("%lld\n",maxxhe);

        }

        else

            printf("%lld\n",maxxren/C);

    }

    return ;

}