#include <algorithm>
#include <iostream>
#include <fstream>
#include <climits>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <iomanip>
#include <cassert>

#include <random>
#include <chrono>

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using ull = unsigned long long;
using ll = long long;

//#define int __int128
//#define int ll
#define pii pair <int, int>
#define all(a) (a).begin(), (a).end()
#define fr first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound

#define vt vector
#define FOR(a, b) for(int i = (a); i <= (b); i++)
#define FORr(a, b) for(int i = (a); i >= (b); i--)
#define sz(x) (int)(x).size()

#define YES cout << "YES\n"
#define NO cout << "NO\n"

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rangerng(int l, int r){
    return uniform_int_distribution<>(l, r)(rng);
}

////////////////////////////////////////////////////////////////////////////////////

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

const int NMAX = 1e5;
const int LOGMAX = 20;

vt <int> adj[NMAX + 1];

int lvl[NMAX + 1];
int dp[NMAX + 1][LOGMAX + 1];

void dfs(int node, int par){
    dp[node][0] = par;
    lvl[node] = lvl[par] + 1;

    for(int vec : adj[node]){
        if(vec != par){
            dfs(vec, node);
        }
    }
}

int LCA(int a, int b){
    if(lvl[a] < lvl[b]){
        swap(a, b);
    }

    int diff = lvl[a] - lvl[b];

    for(int j = LOGMAX; j >= 0; j--){
        if((1 << j) & diff){
            a = dp[a][j];
        }
    }

    if(a == b){
        return a;
    }

    for(int j = LOGMAX; j >= 0; j--){
        if(dp[a][j] != dp[b][j]){
            a = dp[a][j];
            b = dp[b][j];
        }
    }

    return dp[a][0];
}

void solve(){
    int n, m;
    fin >> n >> m;

    for(int i = 2; i <= n; i++){
        int p;
        fin >> p;

        adj[i].pb(p);
        adj[p].pb(i);
    }

    dfs(1, 0);

    for(int j = 1; j <= LOGMAX; j++){
        for(int i = 1; i <= n; i++){
            dp[i][j] = dp[dp[i][j - 1]][j - 1];
        }
    }

    while(m--){
        int a, b;
        fin >> a >> b;
        fout << LCA(a, b) << '\n';
    }
}

signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int T;
    //cin >> T;

    T = 1;

    while(T--){
        solve();
    }

    return 0;
}

/*
2
9 13 
1 9 5
1 2
2 3
3 4
4 5
3 2
6 3
1 6
6 7
7 8
8 9
9 7
8 6
9 6
*/