// https://goo.gl/fBmFxu
#include <bits/stdc++.h>
using namespace std;

#define NMAX        100009
#define MMAX        200009
#define LGMAX       21
#define kInf        (1 << 30)
#define kInfLL      (1LL << 60)
#define kMod        666013
#define edge pair<int, int>
#define x first
#define y second

#define USE_FILES "MLC"

#ifdef USE_FILES
#define cin fin
#define cout fout
ifstream fin("lca.in");
ofstream fout("lca.out");
#endif

// number of tests from "in"
int test_cnt = 1;
void clean_test();

// your global variables are here
int N, M, ancestor[LGMAX][NMAX], level[NMAX];
vector < int > G[NMAX];

void readInput() {
    cin >> N >> M;
    for (int i = 2; i <= N; ++i) {
        cin >> ancestor[0][i];
        G[ancestor[0][i]].push_back(i);
    }
}

void dfs(int node, int _level) {
    level[node] = _level;

    for (auto it : G[node]) {
        dfs(it, _level + 1);
    }
}

void computeAncestors() {
    for (int k = 1; (1 << k) <= N; ++k) {
        for (int i = 1; i <= N; ++i) {
            ancestor[k][i] = ancestor[k - 1][ancestor[k - 1][i]];
        }
    }
}

int lca(int node1, int node2) {
    /*
    * Vreau ca nodul cu nivelul cel mai mare sa fie primul nod
    */
    if (level[node1] < level[node2]) {
        swap(node1, node2);
    }

    int log1, log2;
    for (log1 = 1; (1 << log1) < level[node1]; ++log1);
    // for (log2 = 1; (1 << log2) < level[node2]; ++log2);

    /*
    * Urc in arbore cu primul nod pana cand ajung la acelasi nivel cu nodul 2
    */
    for (int k = log1; k >= 0; --k) {
        if (level[node1] - (1 << k) >= level[node2]) {
            node1 = ancestor[k][node1];
        }
    }

    if (node1 == node2) {
        return node1;
    }

    /*
    * Urc cu ambele noduri in arbore pana cand ajung in acelasi nod
    */
    for (int k = log1; k >= 0; --k) {
        if (ancestor[k][node1] != 0 && ancestor[k][node1] != ancestor[k][node2]) {
            node1 = ancestor[k][node1];
            node2 = ancestor[k][node2];
        }
    }

    return ancestor[0][node1];
}

void computeQueries() {
    for (int i = 1; i <= M; ++i) {
        int node1, node2;
        cin >> node1 >> node2;
        cout << lca(node1, node2) << '\n';
    }
}

void solve() {
    readInput();
    dfs(1, 0);
    computeAncestors();
    computeQueries();
}

void clean_test() {
    // clean if needed
    for (int i = 1; i <= N; ++i)
        G[i].clear();

}

int main() {
//     cin >> test_cnt;
    while (test_cnt--) {
        solve();
    }

    return 0;
}