#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
vector<int> G[N];
int fa[N][21], dep[N];

void dfs(int x, int f) {
	fa[x][0] = f;
	dep[x] = dep[f] + 1;
	for(int i=1; i<=20; i++)
		fa[x][i] = fa[fa[x][i-1]][i-1];
	for(int v : G[x])
		if(v != f) dfs(v, x);
}

int LCA(int x, int v) {
	if(dep[x] < dep[v]) swap(x,v);
	for(int i=20; i>=0; i--)
		if(dep[fa[x][i]] >= dep[v])
			x = fa[x][i];
	if(x == v) return x;
	for(int i=20; i>=0; i--)
		if(fa[x][i] != fa[v][i])
			x=fa[x][i], v=fa[v][i];
	return fa[x][0];
}

int main() {
	int n, m;
	cin >> n;
	for(int i=1; i<n; i++) {
		int p;
		cin >> p;
		G[p].push_back(i);
		G[i].push_back(p);
	}
	dfs(0, -1);
	cin >> m;
	while(m--) {
		int k, x, v;
		cin >> k >> x;
		for(int i=1; i<k; i++) {
			cin >> v;
			x = LCA(x, v);
		}
		cout << x << endl;
	}
	return 0;
}