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

using namespace std;

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

int n, m;
vector<pair<int, int>> queries;
map<int, vector<int>> fii;

vector<int> p_euler;
vector<int> niveluri;

void citire(){
    fin >> n >> m;
    
    int x, y;
    for(int i=2; i<=n; i++){
        fin >> x;
        if(fii.find(x) != fii.end()){
            fii[x].push_back(i);
        } else {
            vector<int> l;
            fii.insert(make_pair(x, l));
            fii[x].push_back(i);
        }
    }
    for(int i=1; i<=m; i++){
        fin >> x >> y;
        queries.push_back(make_pair(x, y));
    }
}

void print(vector<int> v){
    for(int x : v){
        cout << x << " ";
    }
    cout << endl;
}

void dfs(int x, int nivel){ 
    p_euler.push_back(x);
    niveluri.push_back(nivel);

    // iteram in fii
    for(int fiu : fii[x]){ // echiv python: for fiu in fii
        dfs(fiu, nivel+1);
        p_euler.push_back(x);
        niveluri.push_back(nivel);
    }
}

int main(){
    citire();
    dfs(1, 0);
    // print(p_euler);
    // print(niveluri);
    for(auto query : queries){
    
        vector<int>::iterator it1 = niveluri.begin() + (find(p_euler.begin(), p_euler.end(), query.first)-p_euler.begin());
        vector<int>::iterator it2 = niveluri.begin() + (find(p_euler.begin(), p_euler.end(), query.second)-p_euler.begin());
        if(it1 < it2){
            fout << p_euler[min_element(it1, it2) - niveluri.begin()];
        } else {
            fout << p_euler[min_element(it2, it1) - niveluri.begin()];
        }
        fout << endl;
             
    }

    return 0;
}


/*

2 3 4 5 6 7 8 9 10 11
1 1 2 2 2 4 4 6 3 3

fii: {
    1: [2, 3]
    2: []
}

d = {}
d["x"] = []
d.insert( (x, []) )

*/