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

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int N = 1 << 17;
int cnt[N];
vector<PII> g[N];

void clear(int n){
	FOR(i, 0, n)
		g[i].clear();
}

void solve(){
	int n, m, k;
	cin >> n >> m >> k;
	VI es(k);
	FOR(i, 0, k){
		cin >> es[i];
		es[i]--;
	}
	FOR(i, 0, n)
		cin >> cnt[i];
	FOR(i, 0, k)
		cnt[es[i]] = 0;
	
	FOR(i, 0, m){
		int a, b, w;
		cin >> a >> b >> w;
		a--; b--;
		g[a].PB(MP(b, w));
		g[b].PB(MP(a, w));
	}
	
	multiset<PII> q;
	FOR(i, 0, n){
		if(cnt[i] == 0){
			q.insert(MP(0, i));
		}
	}
	int sz = 0;
	while(SZ(q)){
		sz++;
		int v = q.begin()->S;
		int d = q.begin()->F;
		q.erase(q.begin());
		
		
		if(cnt[v] != 0){
			cnt[v]--;
			continue;
		}
		cnt[v]--;
		if(v == 0){
			cout << d << "\n";
			clear(n);
			return;
		}
		
		for(auto e : g[v]){
			int to = e.F;
			int w = e.S;
			if(cnt[to] < 0)
				continue;
			q.insert(MP(d + w, to));
		}
	}
	cout << "-1\n";
	clear(n);
}


int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t;
	cin >> t;
	while(t--)
		solve();
	
	
	return 0;
}