#include <bits/stdc++.h>
#define dbg(x) cerr<< (#x) << ":" << x << endl
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int maxn = 25e4 + 5;
int n, tim[maxn], q, vis[maxn], num, tot;
vector<int> G[maxn];
int read() {
    char ch = getchar();
    int sum = 0;
    while (isdigit(ch)) {
        sum = sum * 10 + ch - '0';
        ch = getchar();
    }
    return sum;
}
void Dfs(int rt) {
    if (tim[rt] != tot) return;
    if (vis[rt] == tot) return;
    vis[rt] = tot;
    num++;
    for (auto v: G[rt]) {
        Dfs(v);
    }
}
void Solve() {
    n = read();
    for (int i = 1; i < n; i++) {
        int u, v;
        u = read(), v = read();
        G[u].push_back(v);
        G[v].push_back(u);
    }
    q = read();
    while (q--) {
        int k;
        k = read();
        tot++;
        vector<int> vec;
        for (int i = 1; i <= k; i++) {
            int x;
            x = read();
            tim[x] = tot;
            vec.push_back(x);
        }
        ll ans = 0;
        for (auto x: vec) {
            if (vis[x] != tot) num = 0, Dfs(x), ans += 1ll * num * (num - 1) / 2;
        }
        printf("%lld\n", ans);
    }
}
int main() {
    //freopen("in", "r", stdin);
    //freopen("out", "w", stdout);
    int T = 1;
    while (T--){
        Solve();
    }
    return 0;
}