#include<bits/stdc++.h>
using namespace std;

#define MAXN 3000005

int n,m,k,cnt,ise[MAXN],d[MAXN],dist[MAXN],del[MAXN],vis[MAXN],Vis[MAXN];
struct node{ int v,w,id; };

vector<node> E[MAXN];
priority_queue<int> Q[MAXN];

inline void upd( int t , int x ){
	if( (int)( Q[t].size() ) <= d[t] ) Q[t].push( x );
	else if( x < Q[t].top() ) Q[t].pop(),Q[t].push( x );
}

int dfs( int x ){
	if( ise[x] ) return 0;
	if( (int)( Q[x].size() ) > d[x] ) return dist[x];
	vis[x] = 1;
	for( node p : E[x] ){
		int v = p.v,w = p.w,id = p.id;
		if( vis[v] || Vis[id] ) continue;
		int tmp = dfs( v ); Vis[id] = 1; 
		if( tmp == -1 ) continue;
		//cerr << "upd" << x << "with" << v << "\n";
		upd( x , tmp + w );
	}
	vis[x] = 0;
	if( (int)( Q[x].size() ) > d[x] ) return dist[x] = Q[x].top();
	return -1;
}

inline void solve(){
	scanf("%d%d%d",&n,&m,&k);
	for( int i = 1 ; i <= n ; i ++ ){
		dist[i] = -1,ise[i] = del[i] = vis[i] = 0;
		E[i].clear();
		while( !Q[i].empty() ) Q[i].pop();
	}
	for( int i = 1 ; i <= k ; i ++ ){
		int x; scanf("%d",&x);
		ise[x] = 1;
	}
	for( int i = 1 ; i <= n ; i ++ ) scanf("%d",&d[i]);
	for( int i = 1 ; i <= m ; i ++ ){
		int u,v,w; scanf("%d%d%d",&u,&v,&w);
		E[u].emplace_back( node{ v , w , ++cnt } );
		E[v].emplace_back( node{ u , w , ++cnt } );
	}
	for( int i = 1 ; i <= cnt ; i ++ ) Vis[i] = 0;
	printf("%d\n",dfs(1));
	//for( int i = 1 ; i <= n ; i ++ ) cerr << dist[i] << "\n";
}

signed main(){
	int testcase; scanf("%d",&testcase);
	while( testcase -- ) solve();
	return 0;
}