#include <bits/stdc++.h>

using namespace std;
ifstream fin("ct.in");
ofstream fout("ct.out");
int t,n,m,x,y,niv,ct,cap;
vector <int> V[100005];
bool viz[100005],v2[100005],v3[100005];
int e[21][200005],l[21][200005],h[100005],rez;

struct pr
{ int a,b,c;
};
pr G[100005];
void DFS(int x)
{ ++ct;
  vector<int>::iterator it;
  if(h[x]==0)
  h[x]=ct;
  e[0][ct]=x;
  l[0][ct]=niv;
  viz[x]=1;
   for(it=V[x].begin();it!=V[x].end();++it)
       if(!viz[*it])
  { ++niv; DFS(*it);
   --niv; ++ct;
      e[0][ct]=x;
      l[0][ct]=niv;
  }

}
inline bool srt(pr x1,pr x2)
{

        return l[0][ h[ x1.a]] >l[0][h [x2.a] ];


}


int main()
{   //fin>>t;
   t=1;
    int i,j,z,sol;
    while(t--)
    { fin>>n>>m; ct=0; niv=0; cap=0; rez=0;
         for(i=0;i<=20;++i)
            for(j=1;j<=200004;++j)
             e[i][j]=l[i][j]=0;
         for(i=1;i<=200004;++i)
         {V[i].erase(V[i].begin(),V[i].end());   v2[i]=v3[i]=0;  h[i]=0; viz[i]=0;}

        for(i=1;i<n;++i)
      { fin>>x;
        V[x].push_back(i+1);
    }
       // { fin>>x>>y;
         //   V[x].push_back(y);
       //     V[y].push_back(x);
      //  }
        DFS(1);

     for(i=1;(1<<i)<=ct;++i)
       for(j=1;j+(1<<i)-1<=ct;++j)
          if(l[i-1][j] < l[i-1][j+(1<<(i-1))] )
                 { l[i][j]=l[i-1][j];
                     e[i][j]=e[i-1][j]; }
           else
           {  l[i][j]=l[i-1][j+(1<<(i-1))];
               e[i][j]=e[i-1][j+(1<<(i-1))];
           }

    for(i=1;i<=m;++i)
  { fin>>x>>y;
   G[++cap].b=x;
   G[cap].c=y;
      x=h[x]; y=h[y];

      if(x>y) swap(x,y);
      z=log2(y-x+1);
      if(l[z][x] <l[z][y-(1<<z)+1])
         sol=e[z][x];
      else sol=e[z][y-(1<<z)+1];
    G[cap].a=sol;
    fout<<sol<<"\n";
  }
  sort(G+1,G+cap+1,srt);

    for(i=1;i<=cap;++i)
      if(!v3[G[i].a] )
      if( G[i].b==G[i].c)
      { v2[G[i].b]=v2[G[i].c]=v2[G[i].a]=1;
          ++rez;
          v3[G[i].a]=1;
      }
     else if( !v2[G[i].c]  &&  !v2[G[i].b])
        { v2[G[i].b]=v2[G[i].c]=v2[G[i].a]=1;
          ++rez;
          v3[G[i].a]=1;
      }
      else
       v2[G[i].b]=v2[G[i].c]=1;




   // fout<<rez<<"\n";


    }
    return 0;
}