#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>

using namespace std;

typedef long long LL;

const int N = 100010, M = 2 * N, L = 20;

bool st[N];
int n, q, h[N], e[M], ne[M], w[M], idx, fa[N], fa_w[N], dep[N], anc[N][L];

void Add(int x, int y, int z) {
    e[idx] = y, w[idx] = z, ne[idx] = h[x], h[x] = idx++;
}

int LCA(int u, int v) {
    if (dep[u] < dep[v]) swap(u, v);
    int d = dep[u] - dep[v];
    for (int i = 0; i < L; ++i) {
        if (d >> i & 1) {
            u = anc[u][i];
        }
    }
    if (u == v) return u;
    for (int i = L - 1; i >= 0; --i) {
        if (anc[u][i] != anc[v][i]) {
            u = anc[u][i];
            v = anc[v][i];
        }
    }
    return anc[u][0]; // 返回u的父节点
}

void DFS(int u, int p) {
    dep[u] = dep[p] + 1, fa[u] = p, anc[u][0] = p;
    for (int i = 1; i < L; ++i) anc[u][i] = anc[anc[u][i - 1]][i - 1];
    for (int i = h[u]; i != -1; i = ne[i]) {
        int v = e[i];
        if (v == p) continue;
        fa_w[v] = w[i];
        DFS(v, u);
    }
}

int main() {
    // freopen("connected.in", "r", stdin);
    // freopen("connected.out", "w", stdout);

    scanf("%d", &n);
    memset(h, -1, sizeof(h));
    for (int i = 1, x, y, z; i <= n - 1; ++i) {
        scanf("%d%d%d", &x, &y, &z);
        ++x, ++y;
        Add(x, y, z), Add(y, x, z);
    }

    DFS(1, 0);

    scanf("%d", &q);
    while (q--) {
        int m;
        scanf("%d", &m);
        vector<int> vec;
        int lca;
        memset(st, 0, (n + 1) * sizeof(bool));
        LL ans = 0LL;
        for (int i = 1, x; i <= m; ++i) {
            scanf("%d", &x);
            ++x;
            if (i == 1) lca = x;
            else lca = LCA(lca, x);
            vec.push_back(x);
        }
        for (auto x : vec) {
            int u = x;
            while (true) {
                if (u == lca || st[u]) break;
                ans += fa_w[u];
                st[u] = true;
                u = fa[u];
            }
        }
        printf("%lld\n", ans);
    }

    return 0;
}