#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#else
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#endif
using namespace std;
// lambda : [] (int a, int b) -> bool { body return }
// string r_str = R"(raw string)"
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define pb push_back
#define LL long long
#define ULL unsigned long long
#define BASE 73
#define NMAX 10000
#define NMAX2 20001
#define MOD1 1000000007
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define CRLINE Duxar(__LINE__);
#define SHOWME(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl;
#define ENTER putchar('\n');
int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
void Duxar(int _this_line) {
#ifndef ONLINE_JUDGE
printf("\n . . . . . . . . . . . . . Passed line - %d\n", _this_line);
#endif
}
template <class T>
void ReadNo(T &_value) {
T _sign = 1;
char ch;
_value = 0;
while(!isdigit(ch = getchar())) {
(ch == '-') && (_sign = -1);
}
do {
_value = _value * 10 + (ch - '0');
} while(isdigit(ch = getchar()));
_value *= _sign;
}
template <class T>
void AddNr(T &a, T b) {
a = a + b;
while (a >= MOD1) {
a -= MOD1;
}
while (a < 0) {
a += MOD1;
}
}
int N, M;
vector <vector <int> > parent, graph;
vector <int> level;
void level_dfs(int iam, int from) {
for (auto to: graph[iam]) {
if (to != from) {
level[to] = level[iam] + 1;
level_dfs(to, iam);
}
}
}
int get_lca(int x, int y) {
int i, par, par1, par2;
if (level[x] < level[y]) {
swap(x, y);
}
for (i = 18; i >= 0 && level[x] > level[y]; --i) {
par = parent[i][x];
if (level[par] >= level[y]) {
x = par;
}
}
if (x == y) {
return x;
}
for (i = 18; i >= 0; --i) {
par1 = parent[i][x];
par2 = parent[i][y];
if (par1 != par2) {
x = par1;
y = par2;
}
}
if (x > 1) {
return parent[0][x];
}
return 1;
}
int main(){
string fileInput = "lca";
#ifdef INFOARENA
freopen((fileInput + ".in").c_str(), "r", stdin);
freopen((fileInput + ".out").c_str(), "w", stdout);
#else
#ifndef ONLINE_JUDGE
freopen("/Users/duxar/Workplace/Xcode Projects/Selectie/Selectie/input", "r", stdin);
#endif
#endif
int i, j, x, y;
ReadNo(N); ReadNo(M);
graph.resize(N + 1);
parent.resize(19, vector <int> (N + 1, 0));
level.resize(N + 1);
for (i = 2; i <= N; ++i) {
ReadNo(parent[0][i]);
graph[parent[0][i]].pb(i);
for (j = 1; j < 19; ++j) {
parent[j][i] = parent[j - 1][parent[j - 1][i]];
if (parent[j][i] == 0) {
break;
}
}
}
level_dfs(1, 0);
for (i = 1; i <= M; ++i) {
ReadNo(x); ReadNo(y);
printf("%d\n", get_lca(x, y));
}
return 0;
}