// right side, 8th row, inner table, harvard

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

#define forn(i, n) for(int i=0; i<(n); i++)
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define f first
#define s second

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
	cout << "[";
	forn(i, (int)v.size()) {
		if(i) cout << ", ";
		cout << v[i];
	}
	return cout << "]";
}
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) {
	return cout << "(" << p.f << ", " << p.s << ")";
}

int n, m, k;
vector<int> e, d;
vector<ll> dist;
vector<vector<pair<int, ll>>> adj;
vector<multiset<ll>> ss;
vector<bool> vis;

void test() {
    cin >> n >> m >> k;
    e.resize(k); forn(i,k) cin >> e[i];
    d.resize(n); forn(i,n) cin >> d[i];
    adj.clear(); adj.resize(n);
    forn(i,n) adj[i].clear();
    forn(i,m) {
        int u,v,w; cin >> u >> v >> w; u--; v--;
        adj[u].pb(mp(v,w));
        adj[v].pb(mp(u,w));
    }

    ss.clear(); ss.resize(n);
    forn(i,n) ss[i].clear();
    dist.assign(n, 1e18);
    priority_queue<pll, vector<pll>, greater<pll>> pq;
    for (int exit : e) {
        exit--;
        pq.push(mp(0,exit));
        dist[exit] = 0;
    }
    vis.assign(n, false);

    while (! pq.empty()) {
        pll cur = pq.top(); pq.pop();
        ll u = cur.s;
        if (vis[u]) continue;
        vis[u] = true;
        for (pii p : adj[u]) {
            ll nb = p.f, w = p.s;
            ss[nb].insert(dist[u]+w);
            while (ss[nb].size() > d[nb]+1) {
                auto it = ss[nb].end(); it--; ss[nb].erase(it);
            }
            if (ss[nb].size() > d[nb]) {
                auto it = ss[nb].end(); it--; 
                // if (dist[nb] > *it) {
                    dist[nb] = *it;
                    pq.push(mp(*it, nb));
                // }
            }
        }
        // cout << u << endl;
        // forn(i, n) {
        //     cout << i << ": ";
        //     for (int j : ss[i]) cout << j << ' ';
        //     cout << '\n';
        // }
    }
    if (dist[0]==1e18) cout << -1 << '\n';
    else cout << dist[0] << '\n';
}

int main() {
	cin.tie(0)->sync_with_stdio(0);

    int t; cin >> t;
    while (t--) test();
}