hack点不过，宣贯

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+5;
int n,m,a[N],dp[N],son[N],siz[N],fa[N];
int top[N],id[N],w[N];
int tot;
vector<int> e[N];

void dfs1(int x,int f,int dep){
	dp[x]=dep;
	siz[x]=1;
	fa[x]=f;
	int maxn=0;
	for(auto v:e[x]){
		if(v==f)continue;
		dfs1(v,x,dep+1);
		siz[x]+=siz[v];
		if(maxn<siz[v]){
			maxn=siz[v];
			son[x]=v;
		}
	}
}

void dfs2(int x,int topfa){
	id[x]=++tot;
	w[tot]=a[x];
	top[x]=topfa;
	if(!son[x])return;
	dfs2(son[x],topfa);
	for(auto v:e[x]){
		if(v==fa[x]||v==son[x])continue;
		dfs2(v,v);
	}
}

int lca(int x,int y){
	while(top[x]!=top[y]){
		if(dp[top[x]]<dp[top[y]]){
			swap(x,y);
		}
		x=fa[top[x]];
	}
	if(dp[x]>dp[y])swap(x,y);
	return x;
}

signed main(){
	cin>>n;
	for(int i=1;i<=n-1;i++){
		int f;
		cin>>f;
		e[f].push_back(i);
		e[i].push_back(f);
	}
	dfs1(0,-1,0);
	dfs2(0,0);
	int q;
	cin>>q;
	while(q--){
		cin>>m;
		for(int i=1;i<=m;i++){
			cin>>a[i];
		}
		int tmp = a[1];
		for(int i=2;i<=m;i++){
			tmp = lca(tmp, a[i]);
		}
		cout<<tmp<<endl;
	}
	return 0;
}