#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;

const int N=100000+5;
const int LG=19;

int n,t;
vector<int>g[N];
int p[3*N],y=0;
int h[3*N];

int first[N];
int last[N];

int rmq[3*N][LG];
int who[3*N][LG];

int nownr=0;
int nr[N];

int lg[N];

inline void dfs(int nod)
{
    nr[nod]=nownr++;
    if(g[nod].size()==0)
    {
        p[++y]=nod;
    }
    else
    {
        p[++y]=nod;
        for(auto &nou:g[nod])
        {
            h[nou]=h[nod]+1;
            dfs(nou);
            p[++y]=nod;
        }
    }
}


int main()
{
   // ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    freopen("lca.in","r",stdin);
    freopen("lca.out","w",stdout);
    for(int i=2;i<N;i++)
    {
        lg[i]=1+lg[i/2];
    }
    cin>>n>>t;
    for(int i=2;i<=n;i++)
    {
        int dad;
        cin>>dad;
        g[dad].push_back(i);
    }
    dfs(1);
    for(int i=1;i<=y;i++)
    {
        last[p[i]]=i;
    }
    for(int i=y;i>=1;i--)
    {
        first[p[i]]=i;
    }
    for(int i=1;i<=y;i++)
    {
        rmq[i][0]=h[p[i]];
        who[i][0]=p[i];
    }
    for(int k=1;(1<<k)<=y;k++)
    {
        for(int i=1;i+(1<<k)-1<=y;i++)
        {
            if(rmq[i][k-1]<rmq[i+(1<<(k-1))][k-1])
            {
                rmq[i][k]=rmq[i][k-1];
                who[i][k]=who[i][k-1];
            }
            else
            {
                rmq[i][k]=rmq[i+(1<<(k-1))][k-1];
                who[i][k]=who[i+(1<<(k-1))][k-1];
            }
        }
    }
    for(int tc=1;tc<=t;tc++)
    {
        int a,b;
        cin>>a>>b;
        if(nr[a]>nr[b])
        {
            swap(a,b);
        }
        int st=first[a];
        int dr=last[b];
        int k=lg[dr-st+1];
        if(rmq[st][k]<rmq[dr-(1<<k)+1][k])
        {
            cout<<who[st][k]<<"\n";
        }
        else
        {
            cout<<who[dr-(1<<k)+1][k]<<"\n";
        }
    }
    return 0;
}