#include <bits/stdc++.h>

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


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

void dfs(int node, int lvl)
{
  level[node] = lvl;
  for(auto it : graf[node])
    dfs(it, lvl + 1);
}

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

  for(logx = 1;(1 << logx) <= level[x];++logx);
  for(logy = 1;(1 << logy) <= level[y];++logy);

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

  return m[0][x];
}

void solve()
{
  dfs(1, 0);
  int x, y;
  for(int i = 1;i <= op;++i)
    f>>x>>y, g<<lca(x, y)<<'\n';
}


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