// Super Idol的笑容
//    都没你的甜
//  八月正午的阳光
//    都没你耀眼
//  热爱105°C的你
// 滴滴清纯的蒸馏水

#include <bits/stdc++.h>

using namespace std;
using PII = pair<int,int>;
using ll = long long;

constexpr int N = 1e6 + 10;

int n, m, k;
int du[N];
bool st[N], ban[N];
int d[N];
vector<array<int,3>> e[N];

void solve() {
	vector<int> ns;
	cin >> n >> m >> k;
	for(int i = 1; i <= m; i ++) ban[i] = false;
	for(int i = 1; i <= n; i ++) e[i].clear(), st[i] = false, du[i] = 0;
	// for(int i = 1; i <= n; i ++) while(g[i].size()) g[i].pop();
	ns.clear();
	for(int i = 1; i <= k; i ++){
		int x;
		cin >> x;
		ns.push_back(x);
	}
	for(int i = 1; i <= n; i ++){
		cin >> du[i];
		du[i] ++;
	}
	for(int i = 1; i <= m; i ++) {
		int l, r, w;
		cin >> l >> r >> w;
		e[l].push_back({w, r, i});
		e[r].push_back({w, l, i});
	}
	priority_queue<PII,vector<PII>,greater<PII>> q;
	for(auto v : ns) {
		du[v] = 0;
		d[v] = 0;
		q.push({0, v});
	}
	while(q.size()) {
		auto [dis, x] = q.top();
		q.pop();
		du[x] --;
		if(du[x] > 0) continue;
		if(st[x]) continue;
		d[x] = dis;
		st[x] = 1;
		for(auto [w, v, id] : e[x]) {
			q.push({w + dis, v});
		}
	}
	if(du[1] > 0) cout << "-1" << "\n";
	else cout << d[1] << "\n";
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	cin >> t;
	while(t--) {
		solve();
	}
}