#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

typedef long long LL;

const int N = 100010, M = 200010, B = 18;

int n, q, a[N], h[N], e[M], w[M], ne[M], idx;
int dep[N], dfn[N], ts, anc[N][B];
LL dist[N], ans;

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

void DFS(int u, int p) {
    dep[u] = dep[p] + 1, anc[u][0] = p;
    dfn[u] = ++ts;
    for (int i = 1; i < B; ++i) anc[u][i] = anc[anc[u][i - 1]][i - 1];
    for (int i = h[u]; ~i; i = ne[i]) {
        int v = e[i];
        if (v == p) continue;
        dist[v] = dist[u] + w[i];
        DFS(v, u);
    }
}

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 < B; ++i) {
        if (d >> i & 1) {
            u = anc[u][i];
        }
    }
    if (u == v) return u;
    for (int i = B - 1; i >= 0; --i) {
        if (anc[u][i] != anc[v][i]) {
            u = anc[u][i], v = anc[v][i];
        }
    }
    return anc[u][0];
}

LL Distance(int u, int v) {
    return dist[u] + dist[v] - 2 * dist[LCA(u, v)];
}

int main() {
    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 k;
        scanf("%d", &k);
        for (int i = 1; i <= k; ++i) {
            scanf("%d", &a[i]);
            ++a[i];
        }
        sort(a + 1, a + k + 1, [](int i1, int i2) { return dfn[i1] < dfn[i2]; });
        ans = 0LL;
        for (int i = 1; i <= k; ++i) {
            ans += Distance(a[i], a[i == k ? 1 : i + 1]);
        }
        printf("%lld\n", ans / 2);
    }

    return 0;
}