#include<fstream>
#include<vector>
#include<deque>
using namespace std;
ifstream f("lca.in");
ofstream g("lca.out");
int n,t,x,y,nivel[100005],tata[100005],i;
vector<int>v[100005];
deque<int>q;
void dfs(int nod)
{
    q.push_back(nod);
    while(!q.empty())
    {
        nod=q.front();
        q.pop_front();
        for(i=0;i<v[nod].size();i++)
        {
            nivel[v[nod][i]]=nivel[nod]+1;
            q.push_back(v[nod][i]);
        }
    }
}
int lca(int x,int y)
{
    while(nivel[x]!=nivel[y])
    {
        if(nivel[x]>nivel[y])
          x=tata[x];
        else
          y=tata[y];
    }
    while(x!=y)
    {
        x=tata[x];
        y=tata[y];
    }
    return x;
}
int main()
{
    nivel[1]=0;
    f>>n>>t;
    for(i=2;i<=n;i++)
    {
        f>>tata[i];
        v[tata[i]].push_back(i);
    }
    dfs(1);
    while(t)
    {
        t--;
        f>>x>>y;
        g<<lca(x,y)<<"\n";
    }
    return 0;
}