#include <bits/stdc++.h>
#define oo 0x3f3f3f3f
#define edge pair<int, int>
#define node first
#define cost second

using namespace std;
ifstream f("lca.in");
ofstream g("lca.out");
int n, m;
int mat[20][100001], level[100001];
vector<int> graf[100001];

void read()
{
  f>>n>>m;
  for(int i = 2;i <= n;++i)
    f>>mat[0][i], graf[mat[0][i]].push_back(i);
}

void dfs(int node, int lvl)
{
  level[node] = lvl;

  for(int vecin : graf[node])
    dfs(vecin, lvl + 1);
}

int lca(int x, int y)
{
  int logx, logy;
  if(level[x] < level[y])
    swap(x, y);

  for(logx = 0;(1 << logx) <= level[x];++logx);
  for(logy = 0;(1 << logy) <= level[y];++logy);
  
  for(int k = logx;k >= 0;--k)
    if(level[x] - (1 << k) >= level[y])
      x = mat[k][x];
  
  if(x == y)
    return x;
  
  for(int k = logy;k >= 0;--k)
    if(mat[k][x] && mat[k][x] != mat[k][y])
      x = mat[k][x], y = mat[k][y];
  
  return mat[0][x];
}

void solve()
{
  dfs(1, 1);

  int x, y;
  for(int i = 1;i <= m;++i)
    f>>x>>y, g<<lca(x, y)<<'\n';
}

int main()
{
  read();
  solve();
  return 0;
}