#include<fstream>
#include <vector>
#include <cmath>
#define LE 100600
using namespace std;
ifstream f("lca.in");
ofstream g("lca.out");
vector <int> W[LE];
int H[LE],arb[LE],sus[LE];
int n,m,i,j,maxl;
void dfs(int nod,int lev)
{
	int j,k;
	H[nod]=lev;
	
	for(j=0;j<W[nod].size();++j)
	{	
		k=W[nod][j];
	    dfs(k,lev+1);
	}
}

int Up(int nod)
{
	int k=1;
	while (k<maxl&&arb[nod]!=0)
		nod=arb[nod],++k;

	return nod;
}
int query(int x,int y)
{

	//while (sus[x]!=sus[y])
		//x=sus[x],y=sus[y];
	
	while (x!=y)
	  H[x]>H[y]? x=arb[x]:y=arb[y];	
	
	return x;
}
int main()
{
	f>>n>>m;
	for(i=2;i<=n;++i) 
		{
			f>>arb[i];
			W[arb[i]].push_back(i);
		}
	dfs(1,1);
	
	/*maxl=sqrt((double)n);
	
	for(i=1;i<=n;++i)
		sus[i]=Up(i);
	*/
	
	
	
	
	int a,b;
	for(i=1;i<=m;++i)
	{
	 f>>a>>b;
     g<<query(a,b)<<'\n';	 
	}
	f.close();g.close();
	return 0;
}