#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;const int N = 2.5e5 + 5;
const int Lg = 20;
const ll inf = 1LL << 60;int n, qn, tot = 0, head[N], top = 0, sta[N << 2], a[N << 2];
int fa[N][Lg], dep[N], dfsc = 0, in[N], out[N];
ll mn[N], f[N];
bool vis[N];struct Edge {int to, nxt;ll val;
} e[N << 1];inline void add(int from, int to, ll val) {e[++tot].to = to;e[tot].val = val;e[tot].nxt = head[from];head[from] = tot;
}template <typename T>
inline void read(T &X) {X = 0; char ch = 0; T op = 1;for(; ch > '9' || ch < '0'; ch = getchar())if(ch == '-') op = -1;for(; ch >= '0' && ch <= '9'; ch = getchar())X = (X << 3) + (X << 1) + ch - 48;X *= op;
}bool cmp(int x, int y) {int dfx = x > 0 ? in[x] : out[-x];int dfy = y > 0 ? in[y] : out[-y];return dfx < dfy;
}inline ll min(ll x, ll y) {return x > y ? y : x;
}void dfs(int x, int fat, int depth, ll nowMn) {fa[x][0] = fat, dep[x] = depth, mn[x] = nowMn;in[x] = ++dfsc;for(int i = 1; i <= 18; i++)fa[x][i] = fa[fa[x][i - 1]][i - 1];for(int i = head[x]; i; i = e[i].nxt) {int y = e[i].to;if(y == fat) continue;dfs(y, x, depth + 1, min(nowMn, e[i].val));}out[x] = ++dfsc;
}inline void swap(int &x, int &y) {int t = x; x = y; y = t;
}inline int getLca(int x, int y) {if(dep[x] < dep[y]) swap(x, y);for(int i = 18; i >= 0; i--)if(dep[fa[x][i]] >= dep[y])x = fa[x][i];if(x == y) return x;for(int i = 18; i >= 0; i--)if(fa[x][i] != fa[y][i])x = fa[x][i], y = fa[y][i];return fa[x][0];
}void solve() {int K, cnt; read(K);for(int i = 1; i <= K; i++) {read(a[i]);vis[a[i]] = 1, f[a[i]] = mn[a[i]];}cnt = K;sort(a + 1, a + 1 + cnt, cmp);for(int i = 1; i < cnt; i++) {int now = getLca(a[i], a[i + 1]);if(!vis[now]) {vis[now] = 1;a[++cnt] = now;}}for(int cur = cnt, i = 1; i <= cur; i++)a[++cnt] = -a[i];if(!vis[1]) a[++cnt] = 1, a[++cnt] = -1;sort(a + 1, a + 1 + cnt, cmp);top = 0;for(int i = 1; i <= cnt; i++) {if(a[i] > 0) sta[++top] = a[i];else {int x = sta[top--];if(x == 1) printf("%lld\n", f[x]);else {int y = sta[top];f[y] += min(mn[x], f[x]);            }f[x] = 0LL, vis[x] = 0;}}
}int main() {read(n);for(int x, y, i = 1; i < n; i++) {read(x), read(y);ll v; read(v);add(x, y, v), add(y, x, v);}    dfs(1, 0, 1, inf);for(read(qn); qn--; ) solve();return 0;
}