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

#define int long long
const int INF = 1e18;

void solve() {
	int n, m, k; cin >> n >> m >> k;
	vector<int> exits;
	for (int i = 0; i < k; i++) {
		int x; cin >> x;
		exits.emplace_back(x);
	}

	vector<int> mon(n+1);
	for (int i = 1; i <= n; i++) {
		cin >> mon[i];
	}

	vector<vector<pair<int, int>>> adj(n+1);
	for (int i = 0; i < m; i++) {
		int x, y, w; cin >> x >> y >> w;
		adj[x].emplace_back(y, w);
		adj[y].emplace_back(x, w);
	}

	vector<int> dist(n+1, INF);
	priority_queue<pair<int, int>> pq;
	for (int i: exits) {
		pq.push({0, i});
		dist[i] = 0;
		mon[i] = 0;
	}

	vector<int> vis(n+1);
	while (pq.size()) {
		auto [ds, u] = pq.top(); pq.pop();
		if (mon[u] > 0) {
			mon[u]--; continue;
		}

		if (vis[u]) continue;
		vis[u] = 1; dist[u] = -ds;

		for (auto [v, w]: adj[u]) {
			if (dist[v] > dist[u] + w) {
				pq.push({-dist[u]-w, v});
			}
		}
	}

	if (dist[1] == INF) {
		cout << "-1\n";
	} else {
		cout << dist[1] << '\n';
	}
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);

	int t; cin >> t;
	while (t--) {
		solve();
	}

	return 0;
}