#include <bits/stdc++.h>
#define db(x) cerr<<#x<<" "<<(x)<<"\n" 
#define db1(x) cerr<<#x<<" "<<(x)<<" "
#define rep(i,a,b) for(int i=a;i<=b;i++) 
#define ll long long
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
using pii = pair<int,int>;
const int N = 2e5+10;
int n,m,q,k,f,fa[N],siz[N],par[N],tmp[N];
int vis[N];
ll ans;
vector<int>  v[N];
void dfs(int x,int f){
	par[x] =f;
	for(auto y:v[x]){
		if(y==f)continue;
		dfs(y,x);
	}
}
int find(int x){
	return x==fa[x]?x:fa[x] =find(fa[x]);
}
ll f1(int x){
	return 1ll*x*(x-1)/2;
}
void Union(int x,int y){
	x = find(x),y = find(y);
	if(x==y)return ;
	fa[x] = y;
	// if(siz[x]>siz[y])swap(x,y);
	// fa[x] = y;
	// ans-=f1(siz[x])+f1(siz[y]);
	// siz[y]+=siz[x];
	// ans+=f1(siz[y]);
}

void solve()
{
	cin>>n;
	for(int i=1;i<n;i++){
		int x,y;cin>>x>>y;
		v[x].push_back(y);
		v[y].push_back(x);
	}
	dfs(1,-1);
	cin>>q;
	for(int i=1;i<=n;i++)fa[i] =i,siz[i] =1;
	for(int t =1;t<=q;t++){
		ans =0;
		cin>>k;
		for(int i=1;i<=k;i++){
			int x;cin>>x;tmp[i] =x;vis[x] =1;
		}
		for(int i=1;i<=k;i++){
			int x = tmp[i],y = par[x];
			if(y==-1||!vis[y])continue;
			Union(x,y);
		}
		for(int i=1;i<=k;i++){
			vis[tmp[i]] =0;
		}
		for(int i=1;i<=k;i++){
			vis[find(tmp[i])]++;
		}
		for(int i=1;i<=k;i++){
			int x =tmp[i];
			if(find(x)==x)ans+=f1(vis[x]);
		}
		cout<<ans<<"\n";

		//cout<<"ans = "<<ans<<"\n";
		// map<int,int> mp;
		// for(int i=1;i<=k;i++){
			// mp[find(tmp[i])]++;
		// }
	// //	ans =0;
	// //	cout<<" t = "<<t<<"\n";
		// for(auto [x,num]:mp){
			// //ans+=num*(num-1)/2;
		// //	cout<<"x = "<<x<<" num ="<<num<<"\n";
		// }
		for(int i=1;i<=k;i++){
			int x = tmp[i];
			vis[tmp[i]] =0;
			fa[tmp[i]] = tmp[i],siz[tmp[i]] = 1;
		}
	//	for(int i=1;i<=n;i++)db1(fa[i]);db(1);
	//	for(int i=1;i<=n;i++)db1(siz[i]);db(1);
		// for(int i=1;i<=n;i++){
			// if(fa[i]!=i)cout<<"NP\n";
		// }
	//	cout<<ans<<"\n";
	}
	
	
	return ;
}
signed main()
{
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	int _=1;
	while(_--)solve();
	return 0;
}