#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int N, M, K;
vector<int> E;
vector<int> D;
vector<int> A, B, W;

vector<vector<int>> G;

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d%d", &N, &M, &K);
    E.resize(K);
    for (int k = 0; k < K; ++k) {
      scanf("%d", &E[k]);
      --E[k];
    }
    D.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%d", &D[u]);
    }
    A.resize(M);
    B.resize(M);
    W.resize(M);
    for (int i = 0; i < M; ++i) {
      scanf("%d%d%d", &A[i], &B[i], &W[i]);
      --A[i];
      --B[i];
    }
    
    G.assign(N, {});
    for (int i = 0; i < M; ++i) {
      G[A[i]].push_back(i);
      G[B[i]].push_back(i);
    }
    
    using Entry = pair<int, int>;
    priority_queue<Entry, vector<Entry>, greater<Entry>> que;
    for (int k = 0; k < K; ++k) {
      D[E[k]] = 0;
      que.emplace(0, E[k]);
    }
    vector<int> dist(N, -1);
    vector<int> cnt(N, 0);
    for (; !que.empty(); ) {
      const int c = que.top().first;
      const int u = que.top().second;
      que.pop();
      if (++cnt[u] == D[u] + 1) {
        dist[u] = c;
        for (const int i : G[u]) {
          const int cc = c + W[i];
          const int v = A[i] ^ B[i] ^ u;
          que.emplace(cc, v);
        }
      }
    }
    printf("%d\n", dist[0]);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}