记录

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize(2)
//#pragma GCC optimize(3, "Ofast", "inline")
#define hh putchar('\n')
#define kg putchar(' ')
#define debug puts("debug")
//#define int long long
//#define int __int128
namespace quickread{
	inline int read(){
		int x=0,f=1;char ch=getchar();
		while (ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
		while (ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
		return x*f;
	}
	inline void write(int x){
	    if(x<0){putchar('-');x=-x;}
	    if(x>9)write(x/10);
	    putchar(x%10+'0');
	}
	inline string readstr(){
    	char ch=getchar();string str="";
		while(!(ch>='0'&&ch<='9')&&!(ch>='a'&&ch<='z')&&!(ch>='A'&&ch<='Z')) ch=getchar();
		while((ch>='0'&&ch<='9')||(ch>='a'&&ch<='z')||(ch>='A'&&ch<='Z')){str+=ch;ch=getchar();}
		return str;
	}
	inline char readchar(){
		char ch=getchar();
		while(!(ch>='0'&&ch<='9')&&!(ch>='a'&&ch<='z')&&!(ch>='A'&&ch<='Z')) ch=getchar();
		return ch;
	}
}
using namespace quickread;
const int N=1e5+10,inf=2147483647;
int n,m,dep[N],dp[N][31],lg[31];
vector<int> tree[N];
void dfs(int u,int f){
	dep[u]=dep[f]+1;
	dp[u][0]=f;
	for(int i=1;i<=lg[dep[u]];i++)
		dp[u][i]=dp[dp[u][i-1]][i-1];
	for(int v:tree[u])
		if(v!=f)
			dfs(v,u);
}
int lca(int x,int y){
	if(dep[x]<dep[y]) swap(x,y);
	while(dep[x]>dep[y]) x=dp[x][lg[dep[x]-dep[y]]-1];
	if(x==y) return y;
	for(int k=lg[dep[x]]-1;k>=0;k--)
		if(dp[x][k]!=dp[y][k]) x=dp[x][k],y=dp[y][k];
	return dp[x][0];
}
signed main(){
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	n=read();
	for(int i=1;i<=n;i++)
		lg[i]=lg[i-1]+(1<<lg[i-1]==i);
	for(int i=2;i<=n;i++){
		int v=read()+1;
		tree[v].push_back(i);
	}
	dfs(1,0);
	m=read();
	for(int i=1;i<=m;i++){
		int k=read(),f=read()+1;
		for(int j=1;j<k;j++){
			int x=read()+1;
			f=lca(f,x);
		}
		write(f-1),hh;
	}
	return 0;
}