#include <bits/stdc++.h>

using namespace std;

#define int long long
#define For(i, a, b) for (int i = a; i <= b; ++i)
#define RFor(i, a, b) for (int i = a; i >= b; --i)
#define get_bit(bit, mask) (((mask) >> (bit)) & 1)
#define set_bit(bit, mask) (mask |= (1ll << bit))
#define top_bit(mask) (31 - __builtin_clz(mask))
#define log(a) cout << #a << " = " << a << '\n'
#define ii pair<int, int>
#define iii tuple<int, int, int>

const int N = 1e5 + 5;
const int INF = 2e18 + 5;

int ans;

int n, m, k;
int e[N], d[N];
vector<ii> adj[N];
int dis[N];

void GetInput() {
    cin >> n >> m >> k;
    For(i, 1, k) cin >> e[i];
    For(i, 1, n) cin >> d[i];
    int x, y, w;
    fill(adj, adj + n + 1, vector<ii>());
    For(i, 1, m)
        cin >> x >> y >> w,
        adj[y].push_back({ x, w });
}

void Rep() {
    cout << ans << '\n';
}

void Solve() {
    fill(dis, dis + n + 1, INF);
    priority_queue<ii, vector<ii>, greater<ii>> que;
    For(i, 1, k) 
        d[e[i]] = 0,
        que.push({ 0, e[i] });
    while (que.size()) {
        auto [len, node] = que.top(); que.pop();
        // cout << node << ": " << d[node] << '\n';
        if (d[node]-- != 0) continue;
        dis[node] = len;
        for (auto [child, del] : adj[node])
            que.push({ len + del, child });
    }
    ans = dis[1] == INF ? -1 : dis[1];
}

signed main() {
    #ifndef LOCAL
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #endif
    int t; cin >> t;
    while (t--)
        GetInput(),
        Solve(),
        Rep();
}