#include <bits/stdc++.h>
#define ull unsigned long long
#define FILES freopen("lca.in","r",stdin);\
              freopen("lca.out","w",stdout);
#define CMAX 15485863
#define fastio std::ios_base::sync_with_stdio(NULL),cin.tie(NULL),cout.tie(NULL);
#define mp make_pair
#define INF 1e18
#define mod 1000000007
#define ll long long
#define SMAX 300
#define MAX 200000
#define pb push_back
#define void inline void

using namespace std;
vector< pair<int,int> > rmq[20];
vector< pair<int,int> > euler;
vector< pair<int,int> > v[MAX+5];
bool check[MAX+5];
ll cate[MAX+5],subtree[MAX+5],road[MAX+5];
int n,q,f[MAX+5];
pair<int,int> Min(pair<int,int>a,pair<int,int>b)
{
    return (a.second > b.second ? b : a);
}
void dfs(int x,int h,ll s)
{
    euler.pb(mp(x,h));
    f[x] = euler.size() - 1;
    check[x] = 1;
    road[x] = s;
    for(vector<pair<int,int > >::iterator i = v[x].begin();i != v[x].end(); ++i){
        if(!check[i->first])
        {
            dfs(i->first,h+1,s + i->second);
            subtree[x] = (subtree[x] + i->second * cate[i->first] + subtree[i->first]) % mod;
            cate[x] += cate[i->first];
            euler.pb({x,h});
        }
    }
    cate[x]++;
}
pair<int,int> Lca(int x,int y)
{
    int d = y - x + 1, p = 1,e = 0;
    while(p <= d) p *= 2,e++;
    p >>= 1,e--;
    return Min(rmq[e][x],rmq[e][y-p+1]);
}
int main()
{
    FILES
    cin >> n >> q;
    for(int i = 1;i < n; ++i)
    {
        int a,b;
        cin >> a;
        v[a].pb(mp(i+1,0)),v[i+1].pb(mp(a,0));
    }
    dfs(1,0,0);
    for(int i = 0;i < euler.size(); ++i) rmq[0].pb(euler[i]);
    int cnt = log2(euler.size()), y = euler.size();
    for(int i = 1;i <= cnt; ++i)
    {
        y -= (1 << (i - 1));
        for(int j = 1;j <= y; ++j) rmq[i].pb(Min(rmq[i-1][j-1],rmq[i-1][j-1+(1 << (i-1))]));
    }
    for(int i = 1;i <= q; ++i)
    {
        int a,b;
        cin >> a >> b;
        pair<int,int> lca = Lca(min(f[a],f[b]),max(f[a],f[b]));
        cout << lca.first << '\n';
    }
}