#include <iostream>
#include <fstream>
#include <queue>
#include <set>
#include <algorithm>
#include <stack>
#include <vector>
#include <iomanip>
#include <cstdio>

using namespace std;

ifstream fin("lca.in");
ofstream fout("lca.out");

#define MAXN 100005
#define MAXL 20

#define foreach(V) for(typeof (V).begin() it = (V).begin(); it != (V).end(); ++it)

int K, N, M;
int L[MAXN << 1], H[MAXN << 1], Lg[MAXN << 1], First[MAXN];
int Rmq[MAXL][MAXN << 2];

vector<int> G[MAXN];

void citire() {
	fin >> N >> M;

	int x;
	for (int i = 2; i <= N; ++i) {
		fin >> x;
		G[x].push_back(i);
	}
}

void dfs(int nod, int lev) {
	H[++K] = nod;
	L[K] = lev;
	First[nod] = K;


	for (int it : G[nod]) {
		dfs(it, lev + 1);

		H[++K] = nod;
		L[K] = lev;
	}
}

void rmq() {
	for (int i = 2; i <= K; ++i)
		Lg[i] = Lg[i >> 1] + 1;
	for (int i = 1; i <= K; ++i)
		Rmq[0][i] = 1;

	for (int i; (1 << i) < K; ++i)
		for (int j = 1; j <= K - (1 << i); ++j) {
			int l = 1 << (i - 1);

			Rmq[i][j] = Rmq[i - 1][j];
			if (L[Rmq[i - 1][j + 1]] < L[Rmq[i][j]])
				Rmq[i][j] = Rmq[i - 1][j + 1];
		}
}

int lca(int x, int y) {
	int diff, l, sol, sh;
	int a = First[x];
	int b = First[y];

	if (a > b)
		swap(a, b);

	diff = b - a + 1;

	l = Lg[diff];
	sol = Rmq[l][a];
	sh = diff - (1 << l);
	if (L[sol] > L[Rmq[l][a + sh]])
		sol = Rmq[l][a + sh];

	return H[sol];
}

int main() {
	citire();
	dfs(1, 0);
	rmq();

	int x, y;
	for (int i = 0; i < M; ++i) {
		fin >> x >> y;
		fout << lca(x, y);
	}

	return 0;
}