#include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define bit(n) (1LL << (n))
#define getbit(x, i) (((x) >> (i)) & 1)
#define pii pair<int, int>
#define ALL(x) x.begin(), x.end()
using namespace std;
const int M = 5e5 + 5;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int oo = 1e9;
const long long ooo = 1e18;
const double pi = acos(-1);

template<typename T1, typename T2> bool mini(T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi(T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

typedef long long ll;

vector <int> adj[N];


long long dp[N];

pair <int, int> cand[N];

int anc[N][17];
int red[N];
int ver[N];
int fr[N];
int to[N];
int h[N];
int w[N];
int n,m,q;


void dfs(int u, int p) {
    if (red[u] == -1)
        red[u] = red[p];
    anc[u][0] = p;
    for (int ind : adj[u]) {
        int v = fr[ind] ^ to[ind] ^ u;
        if (v == p)
            continue;
        dp[v] = dp[u] + w[ind];
        h[v] = h[u] + 1;
        dfs(v, u);
    }
}

int getlca(int u, int v) {
    if (h[u] < h[v])    
        swap(u, v);
    
    for (int i = 16; i >= 0; i--) 
        if (h[u] - bit(i) >= h[v])
            u = anc[u][i];
        
    if (u == v)
        return v;
    
    for (int i = 16; i >= 0; i--)
        if (anc[u][i] != anc[v][i])
            u = anc[u][i], v = anc[v][i];
    return anc[v][0];
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("file.inp", "r",stdin);
    #endif
    
    auto solve = [&]() {
        int n, m, q;
        cin >> n >> m >> q;
    
        for (int i = 0; i < n; i++)
            red[i] = -1;

        for (int i = 1; i <= m; i++) {
            int v; cin >> v;
            v--;
            red[v] = v;
        }

        for (int i = 0; i < n; i++)
            adj[i].clear();

        for (int i = 1; i < n; i++) {
            int u, v;
            cin >> u >> v >> w[i];
            u--, v--;
            fr[i] = u, to[i] = v;
            adj[u].push_back(i);
            adj[v].push_back(i);
        }
        
        dp[0] = h[0] = 0;
        dfs(0, -1);

        for (int j = 1; j < 17; j++)
        for (int i = 0; i < n; i++) {
            int p = anc[i][j - 1];
            if (p == -1)
                anc[i][j] = -1;
            else
                anc[i][j] = anc[p][j - 1];
        }

        while (q--) {
            int k; cin >> k;
            

            for (int i = 0; i < k; i++) {
                int x;
                cin >> x;
                x--;
                ver[i] = x;
            }

            sort(ver + 0, ver + k, [&](int i, int j) {
                return dp[i] - dp[red[i]] < dp[j] - dp[red[j]];
            });

            int sz = 0;
            long long mx = 0;
            for (int i = 0; i < k; i++) {
                int c = getlca(ver[i], ver[k - 1]);
                if (red[c] != red[ver[k - 1]] || red[c] != red[ver[i]])
                    maxi(mx, dp[ver[i]] - dp[red[ver[i]]]);
                else {
                    cand[sz++] = {c, dp[ver[i]] - dp[red[ver[i]]]};
                }
            }

            sort(cand, cand + sz, [&](pair <int, int> a, pair <int, int> b) {
                pair <int, int> pa = {-h[a.fi], a.se};
                pair <int, int> pb = {-h[b.fi], b.se};
                return pa > pb;
            });

            long long ans = ooo;

            for (int i = 0; i < sz;) {
                int j = i;
                while (j < sz && cand[i].fi == cand[j].fi)   
                    j++;
                
                // cerr << cand[i].fi << " " << cand[i].se << "\n";
                int p = cand[i].fi;
                mini(ans, max(mx, dp[ver[k - 1]] - dp[p]));

                for (int k = i; k < j; k++) 
                    maxi(mx, cand[i].se);

                i = j;
            }

            cout << ans << "\n";
        }
    };

    int t; cin >> t;
    while (t--) 
        solve();
    return 0;
}