#include<bits/stdc++.h>
# define int long long
# define rep(i, j, k) for (int i = j; i <= k; ++i)
# define inf 10000000000000000LL
using namespace std;

int T, n, m, k, d[100005], res[100005], hd[100005], to[2000005], nxt[2000005], w[2000005], etimer;
int ok[100005];
struct node
{
	int u, dis;
	bool operator<(const node &x)const{return dis > x.dis;}
};
priority_queue < node > q;
priority_queue < int > dq[100005];
void addedge(int u, int v, int we){to[++etimer] = v, nxt[etimer] = hd[u], hd[u] = etimer; w[etimer] = we;}
void dijkstra()
{
	while (!q.empty())
	{
		int u = q.top().u; if (ok[u]) {q.pop(); continue;} d[u] = q.top().dis, q.pop(); ok[u] = 1;
	//	cerr << u << endl;
		for (int i = hd[u]; i; i = nxt[i]) {dq[to[i]].push(d[u] + w[i]); if (--res[to[i]] <= -2) ++res[to[i]], dq[to[i]].pop(); if (res[to[i]] <= -1) q.push({to[i], dq[to[i]].top()});}
	}
}
signed main()
{
	ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
	cin >> T;
	while (T--)
	{
		cin >> n >> m >> k;
		memset(hd, 0, sizeof(hd)), memset(to, 0, sizeof(to)), memset(nxt, 0, sizeof(nxt)), memset(ok, 0, sizeof(ok)), etimer = 0;
		rep(i, 1, n) d[i] = inf;
		rep(i, 1, n) while (!dq[i].empty()) dq[i].pop();
		rep(i, 1, k) {int x; cin >> x; d[x] = 0, q.push({x, 0}), dq[x].push(0);}
		rep(i, 1, n) cin >> res[i];
		rep(i, 1, m) {int u, v, w; cin >> u >> v >> w; addedge(u, v, w), addedge(v, u, w);}
		dijkstra();
		cout << (d[1] == inf ? -1LL : d[1]) << '\n';
	}
	return 0;
}