#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int N=1e5+5,inf=1e9+7;
vector<P>tu[N];
int d[N];
priority_queue<int>q[N];
void slv(){
    int n,m,k; cin>>n>>m>>k;
    priority_queue<P,vector<P>, greater<P> >Q;
    vector<int>vis(n+1),ok(n+1);
    rep(i,1,n){
        tu[i].clear(); //dis[i]=inf;
        while(q[i].size())q[i].pop();
    }
    rep(i,1,k){
        int x;cin>>x; Q.push({0,x}); //dis[x]=0;
    }
    rep(i,1,n)cin>>d[i];
    rep(i,1,m){
        int u,v,w;cin>>u>>v>>w;
        tu[u].push_back({v,w}); tu[v].push_back({u,w});
    }
    while(Q.size()){
        auto [val,now]=Q.top(); Q.pop();
        if(vis[now])continue;
        // cout<<now<<'h'<<val<<endl;
        if(now==1){
            cout<<val<<'\n';return;
        }
        vis[now]=1;
        for(auto [son,w]:tu[now]){
            if(vis[son])continue;
            int nv=val+w;
            if(q[son].size()>d[son]){
                if(q[son].top()>nv){
                    q[son].pop(); q[son].push(nv);
                }
            }
            else q[son].push(nv);
            if(q[son].size()>d[son]){
                Q.push({q[son].top(),son});
            }
        }
    }
    cout<<"-1\n";
}
int main() {
    IOS
    int T;cin>>T;
    while(T--)slv();
}