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

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int N = 200447;
vector<pair<int, LL>> g[N];
multiset<LL> dis[N];
bool used[N];
int d[N];

void solve()
{
	int n, m, k;
	cin >> n >> m >> k;
	set<pair<LL, int>> q;
	FOR (i, 0, k)
	{
		int v;
		cin >> v;
		v--;
		q.insert({0, v});
	}
	FOR (i, 0, n)
	{
		cin >> d[i];
	}
	FOR (i, 0, m)
	{
		int a, b, w;
		cin >> a >> b >> w;
		a--, b--;
		g[a].PB({b, w});
		g[b].PB({a, w});
	}
	LL ans = -1;
	while (!q.empty())
	{
		int v = q.begin()->S;
		LL D = q.begin()->F;
		if (v == 0) 
		{
			ans = D;
		}
		q.erase(q.begin());
		assert(!used[v]);
		used[v] = 1;
		for (auto [to, w] : g[v])
		{
			if (used[to]) continue;
			if (SZ(dis[to]) > d[to])
				q.erase(MP(*dis[to].rbegin(), to));
			dis[to].insert({D + w});
			if (SZ(dis[to]) > d[to])
			{
				if (SZ(dis[to]) > d[to] + 1)
					dis[to].erase(prev(dis[to].end()));
				q.insert(MP(*dis[to].rbegin(), to));
			}
		}
	}
	cout << ans << '\n';
	FOR (i, 0, n)
	{
		g[i].clear();
		dis[i].clear();
		used[i] = 0;
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	return 0;
}