#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>

#define vt vector
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define pii pair <int, int>

#define fr first 
#define sc second

using namespace std;

string filename = "lca";
ifstream fin(filename + ".in");
ofstream fout(filename + ".out");

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

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

vt <int> adj[NMAX + 1];

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

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

    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 i = LOGMAX; i >= 0; i--){
        if(diff & (1 << i)){
            a = dp[a][i];
        }
    }

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

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

    return dp[a][0];
}

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

    for(int i = 2; i <= n; i++){
        int x;
        fin >> x;
        adj[i].pb(x);
        adj[x].pb(i);
    }

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

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

int main(){

    int T;
    //fin >> T;

    T = 1;

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

    return 0;
}