#include <iostream>
#include <fstream>
#define nMax 100005
#define logMax 20

// dp[i][j] - al 2 ^ j stramos a lui i
using namespace std;
int n, T[nMax], dp[nMax][logMax], L[nMax];
void set_values()
{
    for(int j = 0; (1 << j) <= n; ++j)
      for(int i = 1; i <= n; ++i)
        dp[i][j] = -1;
    for(int i = 2; i <= n; ++i)
        dp[i][0] = T[i];
    for(int j = 1; (1 << j) <= n; ++j)
        for(int i = 2; i <= n; ++i)
          if(dp[i][j - 1] != -1)
             dp[i][j] = dp[dp[i][j - 1]][j - 1];
}
int query(int x, int y)
{
   int step;
   if(L[y] > L[x]) swap(x, y);
   for(step = 0; (1 << step) <= L[x]; ++step);
   --step;
   for(int i = step; i >= 0; --i)  // il aduc pe x la acelasi nivel cu y (daca e nevoie)
     if(L[x] - (1 << i) >= L[y])
        x = dp[x][i];
   for(int i = step; i >= 0; --i)         // aflu LCA(x, y)
      if(dp[x][i] != -1 && dp[x][i] != dp[y][i])
          x = dp[x][i], y = dp[y][i];
   if(x == y) return x;
     else return T[x];
}
void read_and_solve()
{
    ifstream fin("lca.in");
    ofstream fout("lca.out");
    int Q, x, y;
    fin >> n >> Q;
    L[1] = 1;
    for(int i = 2; i <= n; ++i){
        fin >> T[i];
        L[i] = L[T[i]] + 1;
    }
    set_values();
    for(int i = 1; i <= Q; ++i){
        fin >> x >> y;
        fout << query(x, y) << '\n';
    }
}
int main()
{
    read_and_solve();
    return 0;
}