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

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, int>pli;

const ll infl = 1e18;

void solv(){
    int n,m,k;
    cin>>n>>m>>k;
    vector< vector< pii > >g(n+1);
    vector<ll>D(n+1, infl);
    vector<int>baki(n+1);
    vector<int>startnods(k);
    for(int &x : startnods) cin>>x;
    for(int x : startnods) D[x] = 0;

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

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

    priority_queue< pli, vector<pli>, greater<pli> >pq; /// distance, node
    for(int x : startnods){
        for(auto [v,w] : g[x]){
            pq.emplace( w, v );
        }
    }

    while(!pq.empty()){
        auto [dst, u] = pq.top();
        pq.pop();
        if(baki[u]){
            baki[u]--;
            continue;
        }
        D[u] = dst;
        for(auto [v,w] : g[u]) if(D[v]==infl){
            pq.emplace( D[u]+w, v );
        }
    }

    if(D[1]==infl){
        cout<<"-1\n";
    }
    else{
        cout<<D[1]<<"\n";
    }
}
/*
2
3 4 1
3
1 1 1
1 2 1
1 2 2
2 3 1
2 3 2
3 2 2
2 3
2 0 0
1 2 1
1 3 1
*/
int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int tc;
    cin>>tc;
    while(tc--){
        solv();
    }

    return 0;
}