#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M=5e5+5,N=1e5+5;
int n,m,k,h[N],ver[M],nxt[M],edge[M],tot,s,t;ll d[N],ans;bool vis[N],flg[N];
inline void add(int x,int y,int z) {ver[++tot]=y,edge[tot]=z,nxt[tot]=h[x],h[x]=tot;}
priority_queue<pair<ll,int>>q;
void dijkstra(int cur)
{
	memset(d,0x7f,sizeof(d));
	memset(vis,0,sizeof(vis));
	q.push({0,s});d[s]=0;
	while(q.size())
	{
		int u=q.top().second;q.pop();
		if(vis[u]) continue;vis[u]=1;
		if(u==s)
		{
			for(int i=1;i<=n;i++) 
				if(flg[i] && (i&(1<<cur))==0) 
				{
					d[i]=0;
					q.push({0,i});
				}
			continue;
		}
		for(int i=h[u];i;i=nxt[i])
		{
			int v=ver[i],w=edge[i];
			if(d[v]>d[u]+w)
			{
				d[v]=d[u]+w;
				if(!vis[v]) q.push({-d[v],v});
			}
		}
		if(flg[u] && (u&(1<<cur))) d[t]=min(d[t],d[u]);
	}
	ans=min(ans,d[t]);
}

int main()
{
	int T;scanf("%d",&T);
	while(T--)
	{
		memset(h,0,sizeof(h));tot=0;
		memset(flg,0,sizeof(flg));ans=1e18;
		scanf("%d%d%d",&n,&m,&k);s=0,t=n+1;
		for(int i=1,x,y,z;i<=m;i++) 
			scanf("%d%d%d",&x,&y,&z),add(x,y,z);
		for(int i=1,x;i<=k;i++) scanf("%d",&x),flg[x]=1;
		for(int i=0;(1<<i)<=n;i++) dijkstra(i);
		printf("%lld\n",ans);
	}
	return 0;
}