/*
Dijkstra's algorithm to find single source shortest path from vertex 1
https://cses.fi/problemset/task/1671
*/
#include<bits/stdc++.h>
#define task "test"
#define pint pair<int,int>
using namespace std;
const int maxn = 1e5+3;
int n, m, dd[maxn], last[maxn], e[maxn], d[maxn], k;
vector<pint> g[maxn];
vector<int> path;
priority_queue<pint, vector<pint>, greater<pint>> pq;

void dijkstra(int s){
    pq.push({0, s});
    while(!pq.empty()){
        pint p = pq.top();
        int u = p.second;
//        cerr << u << "\n";
        pq.pop();
        --dd[u];
        if(dd[u] == -1){
            d[u] = p.first;
            for(auto [v, w]:g[u]){
                pq.push({p.first+w, v});
            }
        }
    }
}

void solve(){
    cin >> n >> m >> k;
    fill_n(e+1, n, 0);
    d[1] = -1;
    for(int i = 0; i <= n; i++)  g[i].clear();
    for(int i = 1; i <= k; i++){
        int x;
        cin >> x;
        e[x] = 1;
        g[0].emplace_back(x, 0);
    }
    for(int i = 1; i <= n; i++){
        cin >> dd[i];
        if(e[i] == 1) dd[i] = 0;
    }
    for(int i = 1; i <= m; i++){
        int x, y, w;
        cin >> x >> y >> w;
        g[x].emplace_back(y, w);
        g[y].emplace_back(x, w);
    }
    dijkstra(0);
    cout << d[1] << "\n";
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    if(fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}