#include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 0x3f3f3f3f3f3f3f3fll;
const int N = 1000005;
int t, n, m, k;
struct Edge {
	int v, w;
	bool operator<(const Edge &rsh) const
	{
		return w > rsh.w;
	}
};
vector<Edge> g[N];
int dp[N], d[N], e[N];
priority_queue<Edge> q;
priority_queue<int> mn[N];	//求解第d[i]+1小的数，用一个大根堆
signed main()
{
	// cout << "ok" << endl;
	cin >> t;
	while (t--) {
		cin >> n >> m >> k;

		//初始化
		while (q.size())
			q.pop();
		for (int i = 1; i <= n; i++)
			dp[i] = inf;
		for (int i = 1; i <= n; i++)
			g[i].clear();
		for (int i = 1; i <= n; i++)
			while (mn[i].size())
				mn[i].pop();
		for (int i = 1; i <= n; i++)
			dp[i] = inf;

		for (int i = 1; i <= k; i++) {
			scanf("%lld", &e[i]);
			q.push((Edge){e[i], 0});
		}
		for (int i = 1; i <= n; i++) {
			scanf("%lld", &d[i]);
			d[i]++;
		}
		for (int i = 1; i <= m; i++) {
			int u, v, w;
			scanf("%lld%lld%lld", &u, &v, &w);
			g[u].push_back((Edge){v, w});
			g[v].push_back((Edge){u, w});
		}
		while (q.size()) {
			int v = q.top().v, _dp = q.top().w;
			q.pop();
			if (dp[v] < inf)
				continue;
			dp[v] = _dp;

			for (int i = 0; i < g[v].size(); i++) {
				int u = g[v][i].v, w = g[v][i].w;
				if (dp[u] < inf)
					continue;
				// cout<<"1"<<endl;
				if (mn[u].size() < d[u])
					mn[u].push(w + _dp);
				if (mn[u].size() == d[u])
					q.push((Edge){u, mn[u].top()});
			}
		}
		if (dp[1] < inf)
			cout << dp[1] << endl;
		else
			cout << -1 << endl;
	}
	return 0;
}