#include<bits/stdc++.h>
#define int long long

using namespace std;

signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);

    int t;

    cin >> t;

    while (t--) {
        int n, m, k;

        cin >> n >> m >> k;

        vector<vector<pair<int, int>>> a(n);

        vector<int> exits(k);

        for (int &u: exits) {
            cin >> u;
            u -= 1;
        }

        vector<int> d(n);
        for (int &u: d) {
            cin >> u;
        }

        for (int i = 0 ; i < m ; i++) {
            int u, v, w;

            cin >> u >> v >> w;
            u -= 1, v -= 1;

            a[u].push_back({w, v});
            a[v].push_back({w, u});
        }

        for (int &u: exits) {
            d[u] = 0;
        }

        priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

        for (int &u: exits) {
            pq.push({0, u});
        }

        vector<int> dist(n, 1E18);
        vector<int> vis(n);

        for (int &u: exits) {
            dist[u] = 0;
        }

        while (pq.size()) {
            int u = pq.top().second;
            int du = pq.top().first;
            pq.pop();
            if (d[u]) {
                d[u] -= 1;
                continue;
            }

            if (vis[u]) {
                continue;
            }

            vis[u] = 1;
            dist[u] = du;

            for (auto &[w, v]: a[u]) {
                if (dist[u] + w < dist[v]) {
                    pq.push({dist[u] + w, v});
                }
            }
        }

        if (dist[0] == 1E18) {
            cout << -1 << "\n";
        }
        else {
            cout << dist[0] << "\n";
        }
    }
    return 0;
}