#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<61);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int i,n,x,m,cur,tin[nmax],tout[nmax],d[nmax][20];
vector<int>a[nmax];
void dfs(int x,int p)
{
	tin[x]=++cur;
	if(p)d[x][0]=p;
	else d[x][0]=1;
	for(int i=1;i<17;i++)d[x][i]=d[d[x][i-1]][i-1];
	for(int i=0;i<a[x].size();i++)if(a[x][i]!=p)dfs(a[x][i],x);
	tout[x]=++cur;
}
int up(int x,int y)
{
	return tin[x]<=tin[y] && tout[x]>=tout[y];
}
int lca(int x,int y)
{
	if(up(x,y))return x;
	if(up(y,x))return y;
	for(i=16;i>=0;i--)if(!up(d[x][i],y))x=d[x][i];
	return d[x][0];
}
int main()
{
    freopen("lca.in","r",stdin);
	freopen("lca.out","w",stdout);
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>m;
	for(i=2;i<=n;i++)
	{
		cin>>x;
		a[x].pb(i);
		a[i].pb(x);
	}
	dfs(1,0);
	while(m--)
	{
		cin>>x>>i;
		cout<<lca(x,i)<<'\n';
	}
	return 0;
}