#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;

#define F first
#define S second
#define pb push_back
#define ll long long
#define pil pair<int, ll>
#define pii pair<int, int> 
#define vi vector<int> 
#define int long long

const int N = 1e5 + 7, LG = 18;;
int n, m, q, s, leaf, root, h[N], st[N], en[N], red[N], spar[N][LG];
ll hw[N];
vector<pii> ad[N];
pil dis[N];

void rm() {
	s = 0;
	for (int i = 0; i < n; i++) {
		ad[i].clear();
		st[i] = en[i] = h[i] = hw[i] = 0;
		red[i] = false;
		for (int j = 0; j < LG; j++)
			spar[i][j] = 0;
		dis[i] = {0, 0};
	}
}

void input() {
	cin >> n >> m >> q;
	for (int i = 0, r; i < m; i++)
		cin >> r, r--, red[r] = true;
	for (int i = 0, u, v, w; i < n - 1; i++) {
		cin >> u >> v >> w, u--, v--;
		ad[u].pb({v, w}), ad[v].pb({u, w});
	}
}

void dfs(int v, int par, int who, ll len) {
	dis[v] = {who, len};
	st[v] = s++;
	for (auto [u, w]: ad[v])
		if (u != par) {
			spar[u][0] = v;
			hw[u] = hw[v] + w;
			h[u] = h[v] + 1;
			red[u]? dfs(u, v, u, 0): dfs(u, v, who, len + w);
		}
	en[v] = s;
}

bool isPar(int u, int v) {
	return st[v] >= st[u] && en[u] >= en[v];
}

int lca(int u, int v) {
	if (h[u] < h[v])
		swap(u, v);
	for (int j = LG - 1; j >= 0; j--)
		if ((1 << j) <= h[u] - h[v]) 
			u = spar[u][j];
	if (u == v)
		return v;
	for (int j = LG - 1; j >= 0; j--)
		if (spar[u][j] != spar[v][j])
			u = spar[u][j], v = spar[v][j];
	return spar[u][0];
}

bool cmp1(int u, int v) {
	return -dis[u].S < -dis[v].S;
}

bool cmp2(int u, int v) {
	return h[lca(u, leaf)] < h[lca(v, leaf)];
}

bool cmp3(int u, int v) {
	return h[u] < h[v];
}

vi uniq(vi v) {
	vi res;
	sort(v.begin(), v.end());
	res.pb(v[0]);
	for (int i = 1; i < (int) v.size(); i++)
		if (v[i] != v[i - 1])
			res.pb(v[i]);
	return res;
}

int cal(vi vec, int k) {
	if (k == 1)
		return 0;
	sort(vec.begin(), vec.end(), cmp1);
	if (dis[vec[0]].S == dis[vec[1]].S && dis[vec[0]].F != dis[vec[1]].F)
		return dis[vec[0]].S;
	vi vc, row;
	multiset<ll> s;
	ll mx_out = 0;
	leaf = vec[0], root = dis[leaf].F;
	for (int v: vec)
		if (dis[v].F == root) 
			vc.pb(v), s.insert(-dis[v].S), row.pb(lca(v, leaf));
		else 
			mx_out = max(mx_out, dis[v].S);
	row = uniq(row);
	sort(vc.begin(), vc.end(), cmp2), reverse(vc.begin(), vc.end());
	sort(row.begin(), row.end(), cmp3);
	ll mx1 = 0, mn = 1e18;
	int i = row.size() - 1;
	for (int v: vc) {
		int u = row[i];
		if (lca(v, leaf) != u) {
			ll w = s.empty()? 0: -(*s.begin());
			mn = min(mn, max({mx1, mx_out, w}));
			i--;	
			if (i < 0)
				while (true);
			mx1 += hw[u] - hw[row[i]];
		}
		s.erase(s.find(-dis[v].S));
		mx1 = max(mx1, hw[v] - hw[row[i]]);
	}
	return min(mn, max(mx_out, mx1));
}

signed main() {
	ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int T;
	for (cin >> T; T; T--) {
		input(), dfs(0, -1, 0, 0);
		for (int j = 1; j < LG; j++)
			for (int i = 0; i < n; i++)
				spar[i][j] = spar[spar[i][j - 1]][j - 1];
		while (q--) {
			int k;
			cin >> k;
			vi v;
			for (int i = 0, u; i < k; i++) 
				cin >> u, u--, v.pb(u);
			cout << cal(v, k) << '\n';
		}
		rm();
	}
}