#include <bits/stdc++.h>

using namespace std;
using ll = long long;

static constexpr const ll inf = 1e15;

int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, m, k;
    cin >> n >> m >> k;
    vector<bool> is_exit(n);
    for (int i = 0; i < k; i++) {
      int e;
      cin >> e;
      is_exit[--e] = true;
    }
    vector<int> d(n);
    for (int i = 0; i < n; i++) {
      cin >> d[i];
    }
    vector<vector<pair<int, ll>>> graph(n);
    for (int i = 0; i < m; i++) {
      int x, y;
      ll w;
      cin >> x >> y >> w;
      graph[--x].emplace_back(--y, w);
      graph[y].emplace_back(x, w);
    }
    vector<ll> ret(n, inf);
    vector<bool> marked(n, false);
    vector<multiset<ll>> dd(n);
    auto cmp = [&](int x, int y) {
      auto dx = *prev(end(dd[x]));
      auto dy = *prev(end(dd[y]));
      if (dx != dy) return dx < dy;
      return x < y;
    };
    set<int, decltype(cmp)> q(cmp);
    for (int i = 0; i < n; i++) {
      if (is_exit[i]) {
        dd[i].insert(0);
        q.insert(i);
        d[i] = 0;
      }
    }
    while (!q.empty()) {
      auto curr = *q.begin();
      q.erase(q.begin());
      marked[curr] = true;
      ret[curr] = *prev(end(dd[curr]));
      for (const auto& [neighbor, weight] : graph[curr]) {
        if (marked[neighbor]) continue;
        if (int(dd[neighbor].size()) > d[neighbor]) {
          q.erase(neighbor);
        }
        if (!dd[neighbor].empty())
          assert(*prev(end(dd[neighbor])) <= ret[curr] + weight);
        dd[neighbor].insert(ret[curr] + weight);
        while (int(dd[neighbor].size()) > d[neighbor] + 1) {
          dd[neighbor].erase(prev(end(dd[neighbor])));
        }
        if (int(dd[neighbor].size()) > d[neighbor]) {
          q.insert(neighbor);
        }
      }
    }
    if (ret[0] >= inf)
      cout << -1 << '\n';
    else
      cout << ret[0] << '\n';
  }
}