#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fr first
#define sc second
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=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];
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=sqrt(n);
    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);
    }
    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]);
                }
            }
            vis[a[i]]=1;
        }
        for (auto i:t){
            if (vis[i])
                for (auto j:to[i])
                    merge(i,j);
            to[i].clear();
        }
        int ans=0;
        for (int i=1;i<=k;i++)
            if (!tmp[find(a[i])]&&siz[find(a[i])]!=1){
                ans+=siz[find(a[i])]*(siz[find(a[i])]-1)/2;
                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;
        }
        cout<<ans<<'\n';
    }
    return 0;
}