WA + MLE

#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define int long long
int n, q;
vector<pii> g[250010]; 
int dfn[250010], tim, mnw[250010], anc[250010][27], dep[250010];
void init(int u, int fa) {
	dfn[u] = ++tim;
	for (int i = 0; i < g[u].size(); i++) {
		int v = g[u][i].fi, w = g[u][i].se;
		if (v == fa) continue;
		anc[v][0] = u;
		dep[v] = dep[u] + 1;
		for (int k = 1; k <= 25; k++) 
			anc[v][k] = anc[anc[v][k - 1]][k - 1;
		mnw[v] = min(mnw[u], w); init(v, u);
	}
}
int LCA(int u, int v) {
	if (dep[u] < dep[v]) swap(u, v);
	for (int i = 25; i >= 0; i--)
		if (dep[anc[u][i]] >= dep[v]) u = anc[u][i];
	if (u == v) return u;
	for (int i = 25; i >= 0; i--)
		if (anc[u][i] != anc[v][i]) u = anc[u][i], v = anc[v][i];
	return anc[u][0];
} 
int bk[250010];
pii imp[250010]; stack<int> st;
bool cmp(pii a, pii b) { return a.se < b.se; }
vector<int> e[250010];
void add(int u, int v) { e[u].pb(v); }
int f[250010];
void dp(int u) {
	f[u] = 0;
	for (int i = 0; i < e[u].size(); i++) {
		int v = e[u][i];
		dp(v);
		f[u] += f[v];
	}
	if (bk[u]) f[u] = mnw[u]; else f[u] = min(f[u], mnw[u]); bk[u] = 0; e[u].clear();
}
signed main() {
	cin >> n;
	for (int i = 1; i < n; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		g[u].pb(mp(v, w)); g[v].pb(mp(u, w));
	}
	dep[1] = 1; mnw[1] = 1e18; init(1, 0);
	cin >> q;
	while (q--) {
		int k;
		cin >> k;
		for (int i = 1; i <= k; i++) {
			cin >> imp[i].fi; imp[i].se = dfn[imp[i].fi]; bk[imp[i].fi] = 1;
		}
		sort(imp + 1, imp + k + 1);
		while (st.size()) st.pop();
		st.push(1);
		for (int i = 1; i <= k; i++) {
			int u = imp[i].fi;
			int v = st.top(), lca = LCA(u, v);
			while (dep[st.top()] > dep[lca]) {
				v = st.top(); st.pop();
				if (dep[st.top()] <= dep[lca]) {
					add(lca, v);  
				} else {
					add(st.top(), v);
				}
			}
			if (st.top() != lca) st.push(lca); st.push(u);
		}
		while (st.size() > 1) {
			int u = st.top(); st.pop(); add(st.top(), u);
		}
		dp(1);
		cout << f[1] << "\n"; 
	}
	return 0;
}