#include <bits/stdc++.h>
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;
inline int read(){
    int res=0,f=1;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') {res=res*10+(c-'0');c=getchar();}
    return res*f;
}
const int N=2.5e5+5;
int n,q,V,d[N],vis[N],a[N],fa[N],siz[N],tmp[N];
vector<int>e[N],t,to[N],te[N];
int find(int x){
    if (fa[x]==x) return x;
    return fa[x]=find(fa[x]);
}
void merge(int x,int y){
    x=find(x),y=find(y);
    if (x!=y) fa[y]=x,siz[x]+=siz[y];
}
signed main(){
    n=read(),V=700;
    for (int i=1;i<n;i++){
        int u=read(),v=read();
        d[u]++,d[v]++;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    for (int i=1;i<=n;i++){
        fa[i]=i,siz[i]=1;
        if (d[i]>V){
            t.push_back(i);
            for (auto j:e[i])
                if (d[i]>V) te[i].push_back(j);
        }
    }
    q=read();
    while (q--){
        int k=read();
        for (int i=1;i<=k;i++){
            a[i]=read();
            if (d[a[i]]<=V){
                for (auto j:e[a[i]]){
                    if (d[j]>V) to[j].push_back(a[i]);
                    else if (vis[j]) merge(j,a[i]);
                }
            }
            else{
                for (auto j:te[a[i]]){
                    if (d[j]>V) to[j].push_back(a[i]);
                    else if (vis[j]) merge(j,a[i]);
                }
            }
            vis[a[i]]=1;
        }
        for (auto i:t){
            if (vis[i])
                for (auto j:to[i])
                    merge(i,j);
            to[i].clear();
        }
        long long ans=0;
        for (int i=1;i<=k;i++)
            if (!tmp[find(a[i])]&&siz[find(a[i])]!=1){
                ans+=1ll*siz[find(a[i])]*(siz[find(a[i])]-1)/2ll;
                tmp[find(a[i])]=1;
            }
        for (int i=1;i<=k;i++){
            tmp[find(a[i])]=0;
            fa[a[i]]=a[i],siz[a[i]]=1,vis[a[i]]=0;
        }
        printf("%lld\n",ans);
    }
    return 0;
}