#include<iostream>
#include<fstream>
#include<algorithm>
#include<set>
#include<map>
#include<numeric>
#include<unordered_set>
#include<unordered_map>
#include<vector>
#include<stack>
#include<queue>
#include<limits>
#define all(v) v.begin(),v.end()
#define sorti(v) sort(all(v))
#define desc(x) greater<x>()
#define lsb(x) ((x)&(-x))
#define sortd(v) sort(all(v),desc(decltype(v[0])))
#define hmap unordered_map 
#define var auto&
#define hset unordered_set
#define pq priority_queue
#define inf 0x3f3f3f3f
#define exists(x,v) (v.find(x)!=v.end())
#define inrange(x,a,b) (x>=a && x<=b)
#define printv(v) {for(auto it:v) cout<<it<<' ';cout<<'\n';}
#define printa(v,a,b) {for(int i=a;i<=b;i++ ) cout<<v[i]<<' ';cout<<'\n';}
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
template<typename T> T gcd(T a, T b) { T c; while (b) { c = a % b; a = b; b = c; }return a; }
template<typename T> T exp(T a, T n, T m) { T p = 1; while (n) { if (n & 1)p = (p % m * a % m) % m; a = (a % m * a % m) % m; n >>= 1; }return p; }
template<typename T> T exp(T a, T n){T p = 1; while (n) { if (n & 1)p *= a; a *= a;  n >>= 1; }return p;}
template<typename T> T invm(T a, T m) {return exp(a, m - 2, m);}
const int nmax = 1e5 + 5;
const int lmax = 18;
int parent[nmax];
int up[nmax][lmax];
int lvl[nmax];
int n,m;

int main()
{
	freopen("lca.in", "r", stdin);
	freopen("lca.out", "w", stdout);
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for (int i = 2; i <= n; i++)
	{
		cin >> parent[i];
		up[i][0] = parent[i];
		lvl[i] = lvl[up[i][0]] + 1;
	}
	for (int i = 1; i < lmax; i++)
		for (int u = 1; u <= n; u++)
			up[u][i] = up[up[u][i - 1]][i - 1];
	
	while (m--)
	{
		int x, y, ok = 0;;
		cin >> x >> y;
		if (lvl[x] < lvl[y])
			swap(x,y);
		
		for (int i = lmax - 1; i >= 0; i--)
			if (lvl[x] - (1 << i) >= lvl[y])
				x = up[x][i];
		if (x == y)
		{
			cout << x << '\n';
			continue;
		}
		for (int i = lmax - 1; i >= 0; i--)
		{
			if (up[x][i] != up[y][i])
			{
				x = up[x][i];
				y = up[y][i];
			}
		}
		cout << up[x][0]<< '\n';
	
	}
}