#include <iostream>
#include <fstream>
#include <vector>

void mySwap (int &a, int &b) {
	a = a ^ b;
	b = a ^ b;
	a = a ^ b;
}

void recursiveDfs (int &node, int &level, std::vector<int> &eulerRep,
	std::vector<int> &levelEvidence, int *firstOccourance,
	std::vector<std::vector<int>> &graph, int &fromNode) {

	eulerRep.push_back(node);
	levelEvidence.push_back(level);
	firstOccourance[node] = eulerRep.size() - 1;

	for (int i = 0; i < graph[node].size(); ++i) {
		if (graph[node][i] == fromNode)
			continue;

		int nextLevel = level + 1;
		recursiveDfs(graph[node][i], nextLevel, eulerRep, levelEvidence,
			firstOccourance, graph, node);

		eulerRep.push_back(node);
		levelEvidence.push_back(level);
	}
}

void makeRmq(int **rmq, const int &sizeOfRmq, std::vector<int> &levelEvidence, int *lg) {
	int lgIdx;

	for (int i = 2; i <= sizeOfRmq; ++i) {
		lg[i] = lg[i >> 1] + 1;
	}
	for (int i = 1; i <= sizeOfRmq; ++i) {
		rmq[0][i] = i;
	}

	for (int i = 1; (1 << i) < sizeOfRmq; ++i) {
		for (int j = 1; j <= sizeOfRmq - (1 << i); ++j) {
			lgIdx = 1 << (i - 1);
			rmq[i][j] = rmq[i - 1][j];
			if (levelEvidence[rmq[i][j] - 1] > levelEvidence[rmq[i - 1][j + lgIdx] - 1]) {
				rmq[i][j] = rmq[i - 1][j + lgIdx];
			}
		}
	}
}

int getLca(int &node1, int &node2, int *firstOccourance, int *lg,
	std::vector<int> &eulerRep, std::vector<int> &levelEvidence, int **rmq) {

	int oc1 = firstOccourance[node1];
	int oc2 = firstOccourance[node2];

	if (oc1 > oc2)
		mySwap(oc1, oc2);

	int dif = oc2 - oc1 + 1;
	int lgIdx = lg[dif];
	int sol = rmq[lgIdx][oc1 + 1];
	int shift = dif - (1 << lgIdx);

	if (levelEvidence[sol - 1] > levelEvidence[rmq[lgIdx][oc1 + shift + 1] - 1])
		sol = rmq[lgIdx][oc1 + shift + 1];

	return eulerRep[sol - 1];
}

void makeSegmentTree(int &node, int &left, int &right,
	int *segmentTree, std::vector<int> &levelEvidence) {

	if (left == right) {
		segmentTree[node] = left;
		return;
	} else {
		int mijl = ((left + right) >> 1);
		int nodeLeft = (node << 1);
		int nodeRight = ((node << 1) + 1);

		makeSegmentTree(nodeLeft, left, mijl, segmentTree, levelEvidence);
		++mijl;
		makeSegmentTree(nodeRight, mijl, right, segmentTree, levelEvidence);

		if (levelEvidence[segmentTree[nodeLeft] - 1] <
			levelEvidence[segmentTree[nodeRight] - 1]) {
			segmentTree[node] = segmentTree[nodeLeft];
		} else {
			segmentTree[node] = segmentTree[nodeRight];
		}
	}
}

void querryLca(int &node, int &left, int &right,
	int *segmentTree, std::vector<int> &levelEvidence, std::vector<int> &eulerRep,
	int &sol, int &solH, int &nodeLeft, int &nodeRight) {

	if (nodeLeft <= left && right <= nodeRight) {
		if (levelEvidence[segmentTree[node] - 1] < solH) {
			sol = eulerRep[segmentTree[node] - 1];
			solH = levelEvidence[segmentTree[node] - 1];
		}
		// return sol;
	} else {

		int mijl = ((left + right) >> 1);
		int nodeL = (node << 1);
		int nodeR = ((node << 1) + 1);

		if (nodeLeft <= mijl)
			querryLca(nodeL, left, mijl, segmentTree, levelEvidence, eulerRep,
				sol, solH, nodeLeft, nodeRight);
		++mijl;
		if (mijl <= nodeRight)
			querryLca(nodeR, mijl, right, segmentTree, levelEvidence, eulerRep,
				sol, solH, nodeLeft, nodeRight);
	}
}

std::vector<int> lca(std::vector<std::vector<int>> &graph,
	std::vector< std::pair<int, int> > &queries) {

	std::vector<int> eulerRep, levelEvidence, ans;
	int *firstOccourance;
	int node = 1, level = 0, **rmq, *lg;
	int left = 1;

	firstOccourance = new int [graph.size()];

	recursiveDfs(node, level, eulerRep, levelEvidence, firstOccourance, graph, level);

	int *segmentTree;
	segmentTree = new int [eulerRep.size() * 3] {0};

	int right = eulerRep.size() ;

	makeSegmentTree(node, left, right, segmentTree, levelEvidence);

	for (int i = 0; i < queries.size(); ++i) {
		int nodeLeft = queries[i].first;
		int nodeRight = queries[i].second;
		if (nodeLeft > nodeRight)
			mySwap(nodeLeft, nodeRight);
		int sol = 2e10;
		int solH = 2e10;
		int nodeL = firstOccourance[nodeLeft] + 1;
		int nodeR = firstOccourance[nodeRight] + 1;

		querryLca(node, left, right, segmentTree, levelEvidence, eulerRep,
			sol, solH, nodeL, nodeR);

		ans.push_back(sol);
	}

	// for (int i = 0; i < eulerRep.size() * 3; ++i) {
	// 	std::cout << segmentTree[i] << "\n";
	// }


	// for (int i = 0; i < eulerRep.size(); ++i) {
	// 	std::cout << eulerRep[i] << "\n";
	// }

	delete [] firstOccourance;

	delete [] segmentTree;

	return ans;

}

int main () {
	std::ifstream fin("lca.in");
	std::ofstream fout("lca.out");

	int n, m, node1, node2;
	std::vector< std::vector<int> > graph;
	std::vector< std::pair<int, int> > queries;


	fin >> n >> m; // number of nodes and queries
	graph.resize(n + 1);

	for (int i = 2; i <= n; ++i) {
        fin >> node1;
        graph[node1].push_back(i);
        graph[i].push_back(node1);

		// fin >> node1 >> node2;
  //       graph[node1].push_back(node2);
  //       graph[node2].push_back(node1);
	}

	for (int i = 0; i < m; ++i) {
        fin >> node1 >> node2;
		queries.push_back({node1, node2});
	}

	std::vector<int> ans = lca(graph, queries);

	for (int i = 0; i < ans.size(); ++i) {
		fout << ans[i] << "\n";
	}

	return 0;
}