#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
vector<int>a[100001];
int n,m,lvl[100001<<1],eul[100001<<1],k,fs[100001];


void read()
{int x;
scanf("%d%d",&n,&m);
for(int i=2;i<=n;i++)
{scanf("%d ",&x);
a[x].push_back(i);}

}

void dfs(int nod,int lv)
{vector<int>::iterator it;
eul[++k]=nod;
lvl[k]=lv;
fs[nod]=k;
for(it=a[nod].begin();it!=a[nod].end();it++)
	{dfs(*it,lv+1);
	eul[++k]=nod;
	lvl[k]=lv;
	
	}
}


void solve()
{int x,y,min,ok,nod=30;
for(int j=1;j<=m;j++)
{scanf("%d %d",&x,&y);
min=n;ok=0;
if(fs[x]>fs[y])swap(x,y);
for(int i=1;i<=k&&ok!=2;i++)
{if(eul[i]==x)ok=1;
if(ok==1)
	for(int j=i;ok!=2;j++)
	{if(eul[j]==y)ok=2;
	if(lvl[j]<min)
	{min=lvl[j];nod=eul[j];}}
}
printf("%d\n",nod);
}
}

int main()
{freopen("lca.in","r",stdin);
freopen("lca.out","w",stdout);
read();
dfs(1,0);
solve();

return 0;}