#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <tuple>
#include <queue>
#include <numeric>
#include <set>
#include <map>
#include <random>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define piii pair<int, pii>
#define plll pair<long long, pll>
#define tiii array<int, 3>
#define tiiii array<int, 4>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
typedef long long ll;
const int INF = (int)1e9 + 7;

using namespace std;

vector<pii> gph[101010];
bool R[101010];
int dep[101010];
int wdep[101010];
int sp[101010][20];
pii dis[101010];

void dfs(int x, int p, int d, int wd, pii r)
{
	dep[x] = d;
	wdep[x] = wd;
	sp[x][0] = p;
	dis[x] = r;
	for(auto [y, w] : gph[x]) if(p != y) dfs(y, x, d + 1, wd + w, (R[y] ? pii{y, 0} : pii{r.ff, r.ss + w}));
}

int lca(int x, int y)
{
	if(dep[x] > dep[y]) swap(x, y);
	for(int i = 19; i >= 0; --i) if(dep[x] + (1 << i) <= dep[y]) y = sp[y][i];
	for(int i = 19; i >= 0; --i) if(sp[x][i] != sp[y][i]) x = sp[x][i], y = sp[y][i];
	return (x == y ? x : sp[x][0]);
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int T; cin >> T;
	while(T--)
	{
		int n, m, T; cin >> n >> m >> T;
		for(int i = 0; i < n; ++i) gph[i].clear(), R[i] = false;
		for(int i = 0; i < m; ++i)
		{
			int x; cin >> x; --x;
			R[x] = true;
		}
		for(int i = 1; i < n; ++i)
		{
			int x, y, w; cin >> x >> y >> w; --x; --y;
			gph[x].push_back({y, w});
			gph[y].push_back({x, w});
		}
		dfs(0, 0, 0, 0, pii{0, 0});
		for(int j = 1; j < 20; ++j) for(int i = 0; i < n; ++i) sp[i][j] = sp[sp[i][j - 1]][j - 1];

		while(T--)
		{
			int k; cin >> k;
			int A[k]; for(auto &i : A) cin >> i, --i;
			
			pii mx = {-1, 0};
			for(auto i : A) mx = max(mx, pii{dis[i].ss, i});

			vector<pii> V;
			int pmx = 0;
			for(auto i : A)
			{
				if(dis[mx.ss].ff == dis[i].ff) V.push_back({wdep[lca(mx.ss, i)], dis[i].ss});
				else pmx = max(pmx, dis[i].ss);
			}

			sort(V.begin(), V.end());

			int ans = INF;
			for(auto [l, x] : V)
			{
				ans = min(ans, max(wdep[mx.ss] - l, pmx));
				pmx = max(pmx, x);
			}

			cout << ans << '\n';
		}
	}
}