#include <bits/stdc++.h>
using namespace std;

class Reader
{
public:
    Reader() {}
    Reader(const char *file_name)
    {
        input_file = fopen(file_name, "r");
        cursor = 0;
        fread(buffer, SIZE, 1, input_file);
    }
    inline Reader &operator >>(int &n)
    {
        while(buffer[cursor] < '0' || buffer[cursor] > '9')
        {
            advance();
        }
        n = 0;
        while('0' <= buffer[cursor] && buffer[cursor] <= '9')
        {
            n = n * 10 + buffer[cursor] - '0';
            advance();
        }
        return *this;
    }
private:
    FILE *input_file;
    static const int SIZE = 1 << 17;
    int cursor;
    char buffer[SIZE];
    inline void advance()
    {
        ++ cursor;
        if(cursor == SIZE)
        {
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
    }
};

class Writer
{
public:
    Writer(const char *name):
        m_stream(name)
    {
        memset(m_buffer, 0, sizeof(m_buffer));
        m_pos = 0;
    }

    Writer& operator<<(int a)
    {
        int many = 0;
        do
        {
            digit_buffer[many++] = a % 10 + '0';
            a /= 10;
        }
        while (a > 0);
        for (int i = many - 1; i >= 0; --i)
            putchar(digit_buffer[i]);
        return *this;
    }

    Writer& operator<<(const char *s)
    {
        for (; *s; ++s)
            putchar(*s);
        return *this;
    }

    ~Writer()
    {
        m_stream.write(m_buffer, m_pos);
    }

private:
    void putchar(char c)
    {
        m_buffer[m_pos++] = c;
        if (m_pos == kBufferSize)
        {
            m_stream.write(m_buffer, m_pos);
            m_pos = 0;
        }
    }

    static const int kBufferSize = 1 << 17;
    ofstream m_stream;
    char m_buffer[kBufferSize];
    char digit_buffer[30];
    int m_pos;
};

int n,m,k=0;
vector <int> G[100001];
int Euler[200001],Depth[200001],First[200001];
int LOG[200001],RMQ[20][200001];
Reader f("lca.in");
Writer g("lca.out");

void read_data()
{
    f>>n>>m;
    for(int i=1; i<n; i++)
    {
        int x;
        f>>x;
        G[x].push_back(i+1);
    }
}

void DFS(int node,int level=0)
{
    Euler[++k]=node;
    Depth[k]=level;
    First[node]=k;

    for(auto it:G[node])
        DFS(it,level+1),
            Euler[++k]=node,
                       Depth[k]=level;
}

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;

    for(int i=1; (1<<i)<k; ++i)
        for(int j=1; j<=k-(1<<i); ++j)
            if(Depth[RMQ[i-1][j+(1<<(i-1))]]<Depth[RMQ[i-1][j]]) RMQ[i][j] = RMQ[i-1][j + (1<<(i-1))];
            else RMQ[i][j] = RMQ[i-1][j];
}

void compute()
{
    DFS(1);
    buildRMQ();
}

int LCA(int x,int y)
{
    int a=min(First[x],First[y]);
    int b=max(First[x],First[y]);
    int l=LOG[b-a+1];
    if(Depth[RMQ[l][a]]>Depth[RMQ[l][b+1-(1<<l)]]) return Euler[RMQ[l][b+1-(1<<l)]];
    else                                           return Euler[RMQ[l][a]];
}

void solve()
{
    int x,y;
    for(int i=1; i<=m; i++)
    {
        f>>x>>y;
        g<<LCA(x,y)<<'\n';
    }
}

int main()
{
    read_data();
    compute();
    solve();
}