#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

const int MAXN = 100'100;
vector<pair<int, int>> G[MAXN];
const long long INF = 1e18;
multiset<long long> d_mins[MAXN];
multiset<long long> others[MAXN];

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> e(k);
    for (int i = 0; i < k; ++i) {
        cin >> e[i];
        --e[i];
    }
    vector<int> d(n);
    for (int i = 0; i < n; ++i) {
        cin >> d[i];
    }
    for (int i = 0; i < m; ++i) {
        int x, y, w;
        cin >> x >> y >> w;
        --x;
        --y;
        G[x].emplace_back(y, w);
        G[y].emplace_back(x, w);
    }
    vector<long long> dist(n, INF);
    vector<bool> alive(n, true);
    set<pair<long long, int>> Q;
    auto add_val = [&](int i, long long x) {
        if (d_mins[i].size() < d[i]) {
            d_mins[i].emplace(x);
        } else if (d[i] > 0 && *d_mins[i].rbegin() > x) {
            d_mins[i].emplace(x);
            others[i].emplace(*(--d_mins[i].end()));
            d_mins[i].erase(--d_mins[i].end());
        } else {
            others[i].emplace(x);
        }
        if (alive[i] && !others[i].empty() && dist[i] > *others[i].begin()) {
            Q.erase(make_pair(dist[i], i));
            dist[i] = *others[i].begin();
            Q.emplace(dist[i], i);
        }
    };
    for (int v : e) {
        dist[v] = 0;
        Q.emplace(0, v);
    }
    while (!Q.empty()) {
        int v = Q.begin()->second;
        Q.erase(Q.begin());
        alive[v] = false;
        for (auto [u, w] : G[v]) {
            add_val(u, dist[v] + w);
        }
    }
    if (dist[0] == INF)
        cout << -1 << '\n';
    else
        cout << dist[0] << '\n';
    for (int i = 0; i < n; ++i) {
        G[i].clear();
        d_mins[i].clear();
        others[i].clear();
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}