#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long double ld;
typedef long long ll;

const int INF = (int) 2e9;

struct triple
{
 	int u, weight, num;
};

vector <triple> g[100005];
int monster[100005], dist[100005];
bool is_exit[100005];
set <pair <int, int> > sosed[100005];
set <pair <int, int> > cand;
int value[100005];

int main()
{
 	//freopen("input.txt", "r", stdin);
 	//freopen("output.txt", "w", stdout);
	ios_base::sync_with_stdio(0); cin.tie(0);

	int test;
	cin >> test;

	for (int rep = 1; rep <= test; rep++)
	{
	 	int n, m, k;
	 	cin >> n >> m >> k;

	 	for (int i = 1; i <= n; i++) g[i].clear(), is_exit[i] = false, sosed[i].clear(), value[i] = 0;
	 	cand.clear();

	 	for (int i = 1; i <= k; i++)
	 	{
	 	 	int ex;
	 	 	cin >> ex;
	 	 	is_exit[ex] = true;
	 	}

	 	for (int i = 1; i <= n; i++) cin >> monster[i];

	 	for (int i = 1; i <= m; i++)
	 	{
	 	 	int u, v, w;
	 	 	cin >> u >> v >> w;
	 	 	g[u].pb({v, w, i});
	 	 	g[v].pb({u, w, i});
	 	}

	 	for (int i = 1; i <= n; i++)
	 	{
	 		if (!is_exit[i]) dist[i] = INF;
	 		else dist[i] = 0;
	 	}

	 	for (int i = 1; i <= n; i++)
	 	{
	 	 	if (dist[i] != INF) continue;

	 	 	for (const auto &[u, w, num] : g[i])
	 	 		if (dist[u] != INF)
	 	 		{
	 	 		 	sosed[i].insert(mp(dist[u] + w, num));
	 	 		 	if ((int) sosed[i].size() > monster[i] + 1) sosed[i].erase(*sosed[i].rbegin());
	 	 		 	if ((int) sosed[i].size() == monster[i] + 1)
	 	 		 	{
	 	 		 	 	cand.erase(mp(value[i], i));
	 	 		 	 	value[i] = (*sosed[i].rbegin()).x;
	 	 		 	 	cand.insert(mp(value[i], i));
	 	 		 	}
	 	 		}
	 	}

	 	while (!cand.empty())
	 	{
	 	 	pair <int, int> A = *cand.begin();
	 	 	cand.erase(cand.begin());
	 	 	int len = A.x, v = A.y;
	 	 	dist[v] = len;

	 	 	for (const auto &[u, w, num] : g[v])
	 	 	{
	 	 		if (dist[u] != INF) continue;
	 	 		sosed[u].insert(mp(dist[v] + w, num));
	 	 		if ((int) sosed[u].size() > monster[u] + 1) sosed[u].erase(*sosed[u].rbegin());
	 	 		if ((int) sosed[u].size() == monster[u] + 1)
	 	 		{
	 	 		 	cand.erase(mp(value[u], u));
	 	 		 	value[u] = (*sosed[u].rbegin()).x;
	 	 		 	cand.insert(mp(value[u], u));
	 	 	 	}
	 	 	}
	 	}

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

	return 0;
}