#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("lca.in");
ofstream out("lca.out");
int n,m,a1,dp[100005],log[600005],x,y;
int rmq[25][200005];
int ap[100005];
vector<int> v[100005];
vector <int> s;
void dfs(int nod)
{
    s.push_back(nod);
    if(ap[nod]==0)ap[nod]=s.size()-1;
    for(auto i:v[nod])
    {
        dfs(i);
        s.push_back(nod);
    }
}
int main()
{
    in>>n>>m;
    for(int i=2;i<=n;i++)
    {
        in>>a1;
        v[a1].push_back(i);
        dp[i]=dp[a1]+1;
    }
    dfs(1);
    n=s.size();
    for(int i=0;i<n;i++)
    {
        rmq[0][i]=s[i];
    }
    for(int i=2;i<=(1<<19);i++)
    {
        log[i]=log[i/2]+1;
    }
    for(int i=1;i<=19;i++)
    {
        for(int j=0;j<=(n-(1<<i));j++)
        {
            if(dp[rmq[i-1][j]]<dp[rmq[i-1][j+(1<<(i-1))]])
            {
                rmq[i][j]=rmq[i-1][j];
            }
            else
            {
                rmq[i][j]=rmq[i-1][j+(1<<(i-1))];
            }
        }
    }
    int minim,add,lg;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        x=ap[x],y=ap[y];
        if(x>y)swap(x,y);
        lg=log[y-x+1];
        add=(1<<lg);
        if(dp[rmq[lg][x]]<dp[rmq[lg][y-add+1]])
            minim=rmq[lg][x];
        else minim=rmq[lg][y-add+1];
        out<<minim<<'\n';
    }
    return 0;
}