#include <bits/stdc++.h>
#define greedy int
#define mindset main()

using namespace std;
#define FOR(a,b,c) for(ll a = b; a < (c); a++)
#define FORR(a,b,c) for(ll a = b; a > (c); a--)
 
#define READ(x) ll x;cin>>x;
#define READAR(x,n) vll x(n); FOR(readar,0,n) cin >> x[readar];
#define READS(x) string x; cin>>x;
#define SEP(n,mx) (((n) == (mx)-1) ? '\n' : ' ')

#define speedfirst ios_base::sync_with_stdio(false); cin.tie(NULL); 
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
typedef tuple<ll,ll,ll> tll;

void solve() {
    READ(N); READ(M); READ(K);

    READAR(E, K);
    READAR(D, N);

    vector<vpll> adj(N);
    FOR(m,0,M) {
        READ(U); READ(V); READ(W); U--; V--; adj[U].push_back({V,W}); adj[V].push_back({U,W});
    }

    vector<ll> ct(N,0);
    vector<ll> mx(N,0);
    vector<bool> consumed(N, false);

    priority_queue<pll, vector<pll>, greater<pll> > hitq;

    for(auto e: E) {
        e--;

        consumed[e]=true;
        for(auto a: adj[e]) {
            hitq.push({a.second, a.first});
        }
    }

    while(hitq.size()) {
        auto b = hitq.top(); hitq.pop();

        ll d = b.first; ll v = b.second;
        if(consumed[v]) continue;

        ct[v]++;
        mx[v] = max(mx[v], d);
        if(ct[v] > D[v]) {
            consumed[v] = true;
            for(auto a: adj[v]) {
                hitq.push({a.second + mx[v], a.first});
            }
        }

    }

    if(!consumed[0]) cout << "-1\n";
    else cout << mx[0] << "\n";


}

greedy mindset {
    speedfirst;
    READ(T); FOR(t,0,T) solve();
}