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

#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define Sz(x) (int)(x).size()
#define bit(x) (1ll << (x))
using ll = long long;
using db = double;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vs = vector<string>;
using vd = vector<db>;
mt19937 mrand(time(0));

void solve(void)
{
	int n, m, k;
	cin >> n >> m >> k;
	const ll INF = bit(60);
	vl dis(n + 2, INF);
	priority_queue<array<ll, 2>, vector<array<ll, 2>>, greater<array<ll, 2>>> q;
	for (int i = 1; i <= k; i++)
	{
		int x;
		cin >> x;
		dis[x] = 0;
		q.push({dis[x], x});
	}
	vi d(n + 2), vis(n + 2);
	for (int i = 1; i <= n; i++)
	{
		cin >> d[i];
		if (!dis[i]) d[i] = 0;
	}

	vector<vector<array<int, 2>>> e(n + 2);
	for (int i = 1; i <= m; i++)
	{
		int u, v, w;
		cin >> u >> v >> w;
		e[u].pb({v, w}), e[v].pb({u, w});
	}

	while (!q.empty())
	{
		auto [ndis, u] = q.top();
		q.pop();
		if (vis[u] || d[u]) 
		{
			d[u]--;
			continue;
		}
		vis[u] = 1;
		dis[u] = ndis;
		for (auto [v, w] : e[u])
			if (dis[u] + w < dis[v])
				q.push({dis[u] + w, v});
	}
	if (dis[1] == INF)
		cout << -1 << "\n";
	else
		cout << dis[1] << "\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	// cout << fixed << setprecision(10);

	int T = 1;
	cin >> T;
	for (int i = 1; i <= T; i++)
	solve();

	return 0;
}