#include<cstdio>
int m,n,i,j,k,x,y,a[200013],rmq[20][200013],ln[200013],lev[100013],poz[100013];
struct point 
{
	int x;
	point *y;
}*g[100013],*p;
inline int min(const int &i, const int &j)
{
	return(lev[i]<lev[j]?i:j);
}
void go(const int &nod)
{
	a[n]=rmq[0][n]=nod;
	poz[nod]=n;
	++n;
	point *p;
	for(p=g[nod];p!=NULL;p=p->y)
	{
		lev[p->x]=lev[nod]+1;
		go(p->x);
		a[n]=rmq[0][n]=nod;
		++n;
	}
}
int main()
{
	freopen("lca.in","r",stdin);
	freopen("lca.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(i=2;i<=n;++i)
	{
		scanf("%d",&x);
		p=new point;
		p->x=i;
		p->y=g[x];
		g[x]=p;
	}
	lev[1]=0;
	n=0;
	go(1);
	ln[1]=0;
	for(i=2;i<=n;++i)ln[i]=ln[i/2]+1;
	for(i=1;(1<<i)<=n;++i)
		for(j=0;j<=n-(1<<(i-1));++j)
			rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
	for(i=0;i<m;++i)
	{
		scanf("%d%d",&x,&y);
		x=poz[x];y=poz[y];
		if(x>y){j=x;x=y;y=j;}
		y-=(x-1);
		k=ln[y];
		y-=(1<<k);
		printf("%d\n",min(rmq[k][x],rmq[k][x+y]));
	}
	return 0;
}