#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100000+10;
const ll inf=0x3f3f3f3f3f3f;
struct sdf{
	int to,next;ll w;
}eg[8*N];
int head[N],ne=0;
int n,m,k;
int p[N],lst[N];
void add(int x,int y,ll w){
	eg[++ne]={y,head[x],w};
	head[x]=ne;return ;
}
struct wer{
	int pt;ll d;
	bool operator<(const wer&x)const{
		return d>x.d;
	}
};
priority_queue<wer>q;
ll dis[N],ans=inf;
void dij(){
	while(!q.empty())q.pop();
	memset(dis,0x3f,sizeof(dis));
	dis[n+1]=0;q.push({n+1,0});
	while(!q.empty()){
		wer u=q.top();q.pop();
		int pt=u.pt;
		for (int i=head[pt];i!=0;i=eg[i].next){
			int v=eg[i].to;ll w=eg[i].w;
			if (dis[pt]+w<dis[v]){
				dis[v]=dis[pt]+w;
				q.push({v,dis[v]});
			}
		}
	}
	ans=min(ans,dis[n+2]);
	return ;
}
int main(){
	freopen ("WAW.in","r",stdin);
	freopen ("WAW.out","w",stdout);
	int T;scanf("%d",&T);
	while(T--){
		memset(head,0,sizeof(head));ne=0;ans=inf;
		scanf("%d%d%d",&n,&m,&k);
		for (int i=1;i<=m;i++){
			int x,y;ll w;scanf("%d%d%lld",&x,&y,&w);
			add(x,y,w);
		}
		for (int i=1;i<=k;i++){
			scanf("%d",&p[i]);
		}
		int tne=ne;
		for (int i=16;i>=0;i--){
			for (int j=1;j<=k;j++){
				if (p[j]&(1<<i))add(n+1,p[j],0);
				else lst[p[j]]=head[p[j]],add(p[j],n+2,0);
			}
			dij();
			ne=tne;head[n+1]=0;
			for (int j=1;j<=k;j++){
				if (!(p[j]&(1<<i))) head[p[j]]=lst[p[j]];
			}
			for (int j=1;j<=k;j++){
				if (!(p[j]&(1<<i)))add(n+1,p[j],0);
				else lst[p[j]]=head[p[j]],add(p[j],n+2,0);
			}
			dij();
			ne=tne;head[n+1]=0;
			for (int j=1;j<=k;j++){
				if (p[j]&(1<<i)) head[p[j]]=lst[p[j]];
			}
		}
		printf("%lld\n",ans);
	}
	return 0;
}