#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(a) (a).begin(), (a).end()
#define unique(a) a.resize(unique(a.begin(), a.end()) - a.begin())

using namespace std;

#ifdef ONPC
mt19937 rnd(223);
#else
mt19937 rnd(chrono::high_resolution_clock::now()
			.time_since_epoch().count());
#endif

#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

using ll = long long;
using ld = double;

const int maxn = 1e5 + 100, inf = 1e9 + 100;
const long long oo = LLONG_MAX / 2;

void solve() {
    int N, M, K;
    cin >> N >> M >> K;
    vector<int> exit_city;
    for (int i = 1; i <= K; i++) {
        int n;
        cin >> n;
        exit_city.push_back(n);
    }
    vector<int> num_monster(N + 5);
    for (int i = 1; i <= N; i++) {
        cin >> num_monster[i];
    }
    vector<vector<pair<int, long long>>> graph(N + 5);
    for (int i = 1; i <= M; i++) {
        int a, b, w;
        cin >> a >> b >> w;
        graph[a].emplace_back(b, w);
        graph[b].emplace_back(a, w);
    }
    vector<priority_queue<long long>> node_pq(N + 5);
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq;
    vector<long long> dist(N + 5, oo);
    for (int n : exit_city) {
        num_monster[n] = 0;
        dist[n] = 0;
        node_pq[n].push(0);
        pq.push(make_pair(0, n));
    }
    while(pq.size()) {
        auto p = pq.top();
        pq.pop();
        if (p.first != dist[p.second]) {
            continue;
        }
        int n = p.second;
//        cout << n << " " << dist[n] << "\n";
        for (auto e : graph[n]) {
//            cout << "edge: " << e.first << " " << e.second << "\n";

            node_pq[e.first].push(dist[n] + e.second);
            while(node_pq[e.first].size() > num_monster[e.first] + 1) {
                node_pq[e.first].pop();
            }
            if (node_pq[e.first].size() == num_monster[e.first] + 1 && node_pq[e.first].top() < dist[e.first]) {
                dist[e.first] = node_pq[e.first].top();
                pq.push(make_pair(dist[e.first], e.first));
            }
        }
    }
    cout << (dist[1] == oo ? -1 : dist[1]) << "\n";
}

int main() {
#ifdef ONPC
    freopen("../a.in", "r", stdin);
//    freopen("../a.out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed;
    cout.precision(20);
    int T;
    cin >> T;
    while(T--) {
        solve();
    }
    cerr << "\n\nConsumed " << TIME << endl;
}