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

#define int long long
#define MAXN 100005

int n,m,k,d[MAXN],exi[MAXN],ise[MAXN],vis[MAXN];
priority_queue<int> Q[MAXN];

set< pair<int,int> > S;
vector< pair<int,int> > E[MAXN];

inline void upd( int x , int t ){
	if( (int)( Q[x].size() ) <= d[x] ) Q[x].push( t );
	else if( t < Q[x].top() ) Q[x].pop(),Q[x].push( t );
	if( (int)( Q[x].size() ) <= d[x] ) return;
	t = Q[x].top();
	set< pair<int,int> >::iterator It = S.lower_bound( make_pair( x , -1 ) );
	if( It != S.end() && It -> first == x && It -> second < t ) S.erase( It );
	S.insert( make_pair( x , t ) );
}

inline void solve(){
	scanf("%lld%lld%lld",&n,&m,&k);
	for( int i = 1 ; i <= k ; i ++ ) scanf("%lld",&exi[i]),ise[exi[i]] = 1;
	for( int i = 1 ; i <= n ; i ++ ) scanf("%lld",&d[i]);
	for( int i = 1 ; i <= k ; i ++ ) d[exi[i]] = 0;
	for( int i = 1 ; i <= m ; i ++ ){
		int u,v,w; scanf("%lld%lld%lld",&u,&v,&w);
		E[u].emplace_back( make_pair( v , w ) );
		E[v].emplace_back( make_pair( u , w ) );
	}
	for( int i = 1 ; i <= n ; i ++ )
		if( ise[i] ) upd( i , 0 );
	while( S.size() ){
		set< pair<int,int> >::iterator it = S.begin();
		int u = it -> first,W = it -> second; S.erase( it );
		if( vis[u] ) continue;
		vis[u] = 1;
		for( pair<int,int> p : E[u] ){
			int v = p.first,w = p.second;
			//cerr << "update " << v << " with " << u << " and value " << W + w << "\n";
			upd( v , W + w );
		}
	}
	if( (int)( Q[1].size() ) <= d[1] ) printf("-1\n");
	else printf("%lld\n",Q[1].top());
	for( int i = 1 ; i <= n ; i ++ ) ise[i] = exi[i] = vis[i] = d[i] = 0;
	for( int i = 1 ; i <= n ; i ++ ) E[i].clear();
	for( int i = 1 ; i <= n ; i ++ )
		while( !Q[i].empty() ) Q[i].pop();
	S.clear();
}

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