#include <stdio.h>
#include <algorithm>
using namespace std;

#define MAX_N 100000
#define LOG_N 17

int level[MAX_N + 1];
int father[MAX_N + 1][LOG_N];

inline int log2(int x) {
  int log;

  log = 0;
  while (x > 1)
    x >>= 1, ++log;

  return log;
}

inline int computeLevel(int node) {
  if (node == 1)
    return 0;

  if (!level[node])
    level[node] = computeLevel(father[node][0]) + 1;

  return level[node];
}

int lca(int a, int b) {
  int j;

  if (level[a] > level[b])
    swap(a, b);

  if (level[a] < level[b]) {
    j = log2(level[b] - level[a]);
    while (j >= 0 && level[b] > level[a]) {
      if (level[b] - (1 << j) >= level[a])
        b = father[b][j];
      --j;
    }
  }

  if (a != b) {
    for (j = log2(level[a]); j >= 0; --j)
      if (father[a][j] && father[a][j] != father[b][j])
        a = father[a][j], b = father[b][j];

    a = b = father[a][0];
  }

  return a;
}

int main() {
  FILE *fin, *fout;
  fin = fopen("lca.in", "r");
  fout = fopen("lca.out", "w");

  int n, m, i, lvl, a, b;
  fscanf(fin, "%d%d", &n, &m);
  for (i = 2; i <= n; ++i)
    fscanf(fin, "%d", &father[i][0]);

  for (i = 2; i <= n; ++i)
    level[i] = computeLevel(i);

  for (lvl = 1; (1 << lvl) < n; ++lvl)
    for (i = 2; i <= n; ++i)
      father[i][lvl] = father[father[i][lvl - 1]][lvl - 1];

  while (m--) {
    fscanf(fin, "%d%d", &a, &b);
    fprintf(fout, "%d\n", lca(a, b));
  }

  fclose(fin);
  fclose(fout);
  return 0;
}