#include <stdio.h>
#include <vector>
#define NMAX 100005
#define LMAX 2000005
#define pb push_back
#define pii pair <int,int>
#define mp make_pair
#define f first
#define s second
using namespace std;
int n,m,st[NMAX],dr[NMAX],r,C[NMAX],t,ans[LMAX];
vector <int> A[NMAX];
vector <pii> B[NMAX];
void read()
{
	scanf("%d%d",&n,&m);
	int i,x,y;
	for (i=2; i<=n; i++)
	{
		scanf("%d",&x);
		A[x].pb(i);
	}
	for (i=1; i<=m; i++)
	{
		scanf("%d%d",&x,&y);
		B[x].pb(mp(y,i));
	}
}
void dfs1(int nod)
{
	st[nod]=++r;
	int i,vec;
	for (i=0; i<A[nod].size(); i++)
	{
		vec=A[nod][i];
		dfs1(vec);
	}
	dr[nod]=++r;
}
void expand(int nod)
{
	int i,j,stp,step,vec,query;
	for (stp=1; stp<=t; stp<<=1);
	for (i=0; i<B[nod].size(); i++)
	{
		vec=B[nod][i].f; query=B[nod][i].s;
		step=stp;
		for (j=0; step; step>>=1)
			if (j+step<=t && st[C[j+step]]<=st[vec] && dr[vec]<=dr[C[j+step]])
				j+=step;
		ans[query]=C[j];
	}
}
void dfs2(int nod)
{
	C[++t]=nod;
	int i,vec;
	expand(nod);
	
	for (i=0; i<A[nod].size(); i++)
	{
		vec=A[nod][i];
		dfs2(vec);
	}
	t--;
}
void solve()
{
	dfs1(1);
	dfs2(1);
	
	int i;
	for (i=1; i<=m; i++)
		printf("%d\n",ans[i]);
}
int main()
{
	freopen("lca.in","r",stdin);
	freopen("lca.out","w",stdout);
	read();
	solve();
	return 0;
}