#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
typedef pair<ll, ll> PII;
const ll mod = 998244353;
const ll N = 1e5 + 100;
const ll inf = 0x3f3f3f3f;
priority_queue<ll> in[N];
ll d[N];
int a[N];
void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) {
        d[i] = 1e18;
        while (in[i].size())
            in[i].pop();
    }
    priority_queue<PII, vector<PII>, greater<PII>> q;
    vector<bool> dist(n + 1);
    for (int i = 1; i <= k; i++) {
        int x;
        cin >> x;
        d[x] = 0;
        q.push({ 0, x });
    }
    vector<vector<pair<int, int>>> g(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= m; i++) {
        int x, y;
        ll w;
        cin >> x >> y >> w;
        g[x].push_back({ y, w });
        g[y].push_back({ x, w });
    }
    while (q.size()) {
        auto to = q.top();
        q.pop();
        int now = to.second;
        if (dist[now])
            continue;
        dist[now] = true;
        for (auto x : g[now]) {
            int v = x.first, dis = x.second;
            // if (dist[v])
            //     continue;
            in[v].push(d[now] + dis);
            if (in[v].size() > a[v] + 1)
                in[v].pop();
            if (in[v].size() == a[v] + 1 && d[v] > in[v].top()) {
                d[v] = in[v].top();
                q.push({ d[v], v });
            }
        }
    }
    if (d[1] == 1e18) {
        cout << -1 << endl;
    } else {
        cout << d[1] << endl;
    }
}
/*
 */
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}