#include <bits/stdc++.h>

using namespace std;

ifstream in("lca.in");
ofstream out("lca.out");
int n,m,t[20][100005],nivel[100005];
vector<int> graf[100005];
void dfs(int nod,int lvl)
{
	nivel[nod]=lvl;
	for(auto x:graf[nod])
		dfs(x,lvl+1);
}

int lca(int x,int y)
{
	if(nivel[x]<nivel[y])
			swap(x,y);
		int logx=1,logy=1;
		while((1<<logx)<nivel[x]) logx++;
		while((1<<logy)<nivel[y]) logy++;
		for(int k=logx;k>=0;k--)
			if(nivel[x]-(1<<k)>=nivel[y])
				x=t[k][x];

		if(x==y) return x;
		for(int k=logy;k>=0;k--)
			if(t[k][x] && t[k][x]!=t[k][y])
			{
				x=t[k][x];
				y=t[k][y];
			}
		 return t[0][x];
}
int main()
{
	int n,m;
	in>>n>>m;
	for(int i=2;i<=n;i++)
	{
		in>>t[0][i];
		graf[t[0][i]].push_back(i);
	}
	for(int k=1;(1<<k)<=n;k++)
		for(int i=1;i<=n;i++)
			t[k][i]=t[k-1][t[k-1][i]];
	dfs(1,0);
	while(m--)
	{
		int x,y;
		in>>x>>y;
		out<<lca(x,y);	
		 out<<"\n";
	}
	return 0;
}