#include <fstream>
#include <vector>
using namespace std;

ifstream fin("lca.in");
ofstream fout("lca.out");

const int NMax = 100005;
int N,M;
int TT[NMax],Level[NMax];
int A[20][NMax],Log[NMax];
vector <int> G[NMax];

void Read()
{
  fin>>N>>M;
  for(int i = 2; i <= N; ++i)
    {
      fin>>TT[i];
      G[TT[i]].push_back(i);
    }

}

void Precalculate()
{
  for(int i = 2; i <= N; ++i)
    Log[i] = Log[i/2] + 1;

  for(int i = 1; i <= N; ++i)
    A[0][i] = TT[i];

  for(int i = 1; (1<<i) <= N; ++i)
    for(int j = 1; j <= N; ++j)
      A[i][j] = A[i-1][A[i-1][j]];
}

void DFS(int Nod)
{
  for(int i = 0; i < (int)G[Nod].size(); ++i)
    {
      int Vecin = G[Nod][i];
      Level[Vecin] = Level[Nod] + 1;
      DFS(Vecin);
    }
}

int LCA(int x, int y)
{
  if(Level[x] < Level[y])
    swap(x,y);

  while(Level[x]!=Level[y])
   {
     int K = Log[Level[x]-Level[y]];
      x = A[K][x];
   }

  if(x == y)
      return x;

  for(int K = Log[Level[x]]; K >= 0 ; K--)
    {
      if(A[K][x] != A[K][y])
      {
        x = A[K][x];
        y = A[K][y];
      }
    }
  return A[0][x];
}


void SolveandPrint()
{
  DFS(1);
  Precalculate();
  while(M--)
  {
    int x,y;
    fin>>x>>y;
    fout<<LCA(x,y)<<"\n";
  }
}

int main()
{
    Read();
    SolveandPrint();
    return 0;
}