#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "lca.in";
const char outfile[] = "lca.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 100005;
const int oo = 0x3f3f3f3f;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

Graph g;
int first[MAXN], k;
int euler[MAXN << 2], level[MAXN << 2], rmq[20][MAXN << 2];
int Log[MAXN << 2];

void dfs(int node, int actlevel) {
    first[node] = ++ k;
    euler[k] = node;
    level[k] = actlevel;
    for(It it = g[node].begin(), fin = g[node].end(); it != fin ; ++ it) {
        dfs(*it, actlevel + 1);
        euler[++ k] = node;
        level[k] = actlevel;
    }
}

inline void buildRMQ() {
    for(int i = 2 ; i <= k ; ++ i)
        Log[i] = Log[i >> 1] + 1;
    for(int i = 1 ; i <= k ; ++ i)
        rmq[0][i] = i;
    /// rmq[i][j] = min(j, j + 2 ^ i - 1)
    /// rmq[i][j] = min(min(i, j + 2 ^ (i - 1) - 1), min(j + 2 ^ (i - 1), j + 2 ^ (i - 1) + 2 ^ (i - 1) - 1
    for(int i = 1 ; (1 << i) <= k ; i ++) {
        for(int j = 1 ; j + (1 << i) - 1 <= k ; ++ j) {
            rmq[i][j] = rmq[i - 1][j];
            int aux = (1 << (i - 1));
            if(level[rmq[i][j]] > level[rmq[i - 1][j + aux]])
                rmq[i][j] = rmq[i - 1][j + aux];
        }
    }
}

inline int lca(int x, int y) {
    int a = first[x];
    int b = first[y];
    if(a > b)
        swap(a, b);
    int diff = b - a + 1;
    int l = Log[diff];
    int ans = rmq[l][a];
    if(level[ans] > level[rmq[l][b - (1 << l) + 1]])
        ans = rmq[l][b - (1 << l) + 1];
    return euler[ans];
}

int n, m;

int main() {

    fin >> n >> m;
    for(int i = 2 ; i <= n ; i ++ ) {
        int father;
        fin >> father;
        g[father].push_back(i);
    }
    dfs(1, 1);
    buildRMQ();
    for(int i = 1 ; i <= m ; ++ i) {
        int x, y;
        fin >> x >> y;
        fout << lca(x, y) << '\n';
    }
    fin.close();
    fout.close();
    return 0;
}