#include <fstream>
#include <vector>
using namespace std;
ifstream f ("lca.in");
ofstream g ("lca.out");
const int nmax=1e5+3;
vector <int> v[nmax];
int lvl[nmax],t[nmax],n,m,a,b;
void dfs(int nod)
{
      for(int i=0;i<v[nod].size();++i)
      {
            lvl[v[nod][i]]=lvl[nod]+1;
            dfs(v[nod][i]);
      }
}
int main()
{
      f>>n>>m;
      for(int i=2;i<=n;++i)
      {
            f>>t[i];
            v[t[i]].push_back(i);
      }
      lvl[1]=1;
      dfs(1);
      while(m--)
      {
            f>>a>>b;
            while(a!=b)
            {
                  if(lvl[a]>lvl[b]) a=t[a];
                  else b=t[b];
            }
            g<<a<<'\n';
      }
      return 0;
}