#include<bits/stdc++.h>
using namespace std;
const int M=5010,N=1010;
int n,m,k,h[N],v[M],e[M],ne[M],b[N],t,zd[N],tot;
long long d[N][N],mi;
void chu()
{
	memset(h,0,sizeof(h));
	memset(v,0,sizeof(v));
	memset(e,0,sizeof(e));
	memset(ne,0,sizeof(ne));
	memset(b,0,sizeof(b));
	memset(d,0x3f,sizeof(d));
	tot=0;
	mi=0x3f3f3f3f3f3f3f3f;
}
void add(int x,int y,long long z)
{
	tot++;
	v[tot]=y;
	e[tot]=z;
	ne[tot]=h[x];
	h[x]=tot;
}
void di(int qd)
{
	memset(zd,0,sizeof(zd));
	priority_queue< pair<long long,int> > qu;
	d[qd][qd]=0;
	qu.push(make_pair(0,qd));
	while(qu.size())
	{
		int x=qu.top().second;
		qu.pop();
		if(zd[x])
		{
			continue;
		}
		zd[x]=1;
		for(int i=h[x];i;i=ne[i])
		{
			int y=v[i];
			long long z=e[i];
			if(d[qd][y]>d[qd][x]+z)
			{
				d[qd][y]=d[qd][x]+z;
				qu.push(make_pair(-d[qd][y],y)); 
			}
		}
	}
}
int main()
{
	freopen("WAW.in","r",stdin);
    freopen("WAW.out","w",stdout);
	cin>>t;
	for(int i=1;i<=t;i++)
	{
		chu();
		cin>>n>>m>>k;
		for(int j=1;j<=m;j++)
		{
			int x,y;
			long long z;
			cin>>x>>y>>z;
			if(x==y)
			{
				continue;
			}
			add(x,y,z);
	    }
		for(int j=1;j<=k;j++)
		{
			int l;
			cin>>l;
			b[l]=1;
			di(l);
		}
		for(int j=1;j<=n;j++)
		{
			for(int k=1;k<=n;k++)
			{
				if(b[j]==1&&b[k]==1&&d[j][k]<mi&&d[j][k]!=0)
				{
					mi=d[j][k];
				}
			}
		}
		cout<<mi<<endl;
	}
	return 0;
}