#include <fstream>
#include <vector>

using namespace std;

class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if(sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while(!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if(c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while(isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if(sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if(vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while(*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

InParser fin("lca.in");
OutParser fout("lca.out");

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

int n, m, cnt;

int t[LOGMAX][2 * NMAX], log2[2 * NMAX], ap[NMAX], niv[NMAX];
/// ap[i] = prima aparitie a nodului i in reprezentarea Euler

vector<int> G[NMAX];

void citire() {
    fin >> n >> m;

    for(int i = 1, x; i < n; ++i) {
        fin >> x;
        G[x].push_back(i + 1);
    }

    niv[1] = 1; /// putea fi si 0, dar asa imi place
}

void dfs(int x) {
    t[0][++cnt] = x;
    ap[x] = cnt;

    for(const auto& y : G[x]) {
        niv[y] = niv[x] + 1;
        dfs(y);
        t[0][++cnt] = x;
    }
}

void initLog() {
    log2[0] = -1;
    for(int i = 1; i <= cnt; ++i) {
        log2[i] = log2[i >> 1] + 1;
    }
}

void genRMQ() {
    initLog();

    for(int i = 1, lg = 2; lg <= cnt; ++i, lg <<= 1) {
        for(int j = 1; j + lg - 1 <= cnt; ++j) {
            int a = t[i - 1][j], b = t[i - 1][j + lg / 2];

            if(niv[a] < niv[b]) {
                t[i][j] = a;
            } else {
                t[i][j] = b;
            }
        }
    }
}

int query(int x, int y) {
    if(x > y) swap(x, y);

    int k = log2[y - x + 1], lg = (1 << k), a = t[k][x], b = t[k][y - lg + 1];

    if(niv[a] < niv[b]) {
        return a;
    } else {
        return b;
    }
}

void solutie() {
    int x, y;

    while(m--) {
        fin >> x >> y;
        fout << query(ap[x], ap[y]) << '\n';
    }
}

int main() {
    citire();
    dfs(1);
    genRMQ();
    solutie();

    return 0;
}