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