#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 1e5 + 5, M = 5e5 + 5;
constexpr i64 INF = (1ll << 60);

int T, n, m, k;
int a[N];
i64 dis[N];
bool vis[N];
std::vector<std::pair<int, int>> G[N];
struct Edge { int u, v, w; } E[M];

void dijkstra(int s) {
    for (int i = 0; i <= n + 1; i++) dis[i] = INF, vis[i] = false; 
    dis[s] = 0;

    std::priority_queue<std::pair<int, int>> q;
    q.push({0, s});

    while (!q.empty()) {
        int u = q.top().second; q.pop();

        if (vis[u]) continue;
        vis[u] = true;

        for (auto e : G[u]) {
            int v = e.first, w = e.second;
            if (dis[u] + w < dis[v]) {
                dis[v] = dis[u] + w;
                q.push({-dis[v], v});
            }
        }
    }
}

void solve() {
    std::cin >> n >> m >> k;
    for (int i = 1; i <= m; i++) std::cin >> E[i].u >> E[i].v >> E[i].w;
    for (int i = 1; i <= k; i++) std::cin >> a[i];

    i64 ans = INF;
    for (int i = std::__lg(n); ~i; i--) {
        for (int j = 0; j <= n + 1; j++) G[j].clear();
        for (int j = 1; j <= m; j++) {
            int u = E[j].u, v = E[j].v, w = E[j].w;
            G[u].push_back({v, w});
        }
        for (int j = 1; j <= k; j++) {
            if (a[j] >> i & 1) G[0].push_back({a[j], 0});
            else G[a[j]].push_back({n + 1, 0});
        }
        dijkstra(0); ans = std::min(ans, dis[n + 1]);
        for (int j = 0; j <= n + 1; j++) G[j].clear();
        for (int j = 1; j <= m; j++) {
            int u = E[j].u, v = E[j].v, w = E[j].w;
            G[u].push_back({v, w});
        }
        for (int j = 1; j <= k; j++) {
            if (a[j] >> i & 1) G[a[j]].push_back({n + 1, 0});
            else G[0].push_back({a[j], 0});
        }
        dijkstra(0); ans = std::min(ans, dis[n + 1]);
    }
    std::cout << ans << "\n";
}

int main() {

    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    std::cin >> T;
    while (T--) solve();    

    return 0;
}