#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5+5;
const int LIMIT = 17;

int n,m,power;
int head[MAXN];
int Next[MAXN];
int to[MAXN];
int cnt=1;
int deep[MAXN],stjump[MAXN][LIMIT+1];
int fa[MAXN];

inline void addedge(int u,int v){
    Next[cnt]=head[u];
    to[cnt]=v;
    head[u]=cnt++;
}

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*10+ch-'0',ch=getchar();
    return x*f;
}


void dfs(int u, int f) {
    fa[u]=max(fa[u],fa[f]);//这里这样写是对的
    deep[u] = deep[f] + 1;
    stjump[u][0] = f;
    for (int p = 1; p <= power; p++) {
        stjump[u][p] = stjump[stjump[u][p - 1]][p - 1];
    }
    //完成u的deep  stjump
    for (int e = head[u]; e != 0; e = Next[e]) {
        if (to[e] != f) {
            //fa[to[e]]=max(fa[f],fa[to[e]]);//这里这样写 并且上面的那个地方不写  为什么是错的啊
            dfs(to[e], u);
        }
        //向下递归
    }
}

int lca(int a, int b) {
    if (deep[a] < deep[b]) {
        int tmp = a;
        a = b;
        b = tmp;
    }
    //确定大小关系
    for (int p = power; p >= 0; p--) {
        if (deep[stjump[a][p]] >= deep[b]) {
            a = stjump[a][p];
        }
    }
    //首先将两者变为同一高度
    if (a == b) {
        return a;
    }
    //如果相同说明就是祖先关系
    for (int p = power; p >= 0; p--) {
        if (stjump[a][p] != stjump[b][p]) {
            a = stjump[a][p];
            b = stjump[b][p];
        }
        //判断跳完后是否符合规则
    }
    return stjump[a][0];
    //我们将头结点的祖先设置为0  实际上没有0
}

int main()
{
    n=read();
    power=log2(n);
    fa[1]=1;
    for(int i=2;i<=n;i++){
        int u;
        u=read();
        u++;
        fa[i]=i;
        addedge(u,i);
    }
    dfs(1,1);
//    for(int i=1;i<=n;i++){
//        cout<<i<<": "<<fa[i]<<endl;
//    }
//    cout<<endl;
    m=read();
    int q,ans;
    for(int i=1,u;i<=m;i++){
        q=read();
        u=read();
        u++;
        ans=u;
        for(int i=2;i<=q;i++){
            u=read();
            u++;
            ans=lca(ans,u);
        }
        //cout<<ans<<' ';
        cout<<(fa[ans]-1)<<endl;
    }
    return 0;
}

/*
7
3 3 4 0 0 5
1
2 1 2
*/

就是dfs中的那个注释的地方