#define _CRT_SECURE_NO_WARNINGS
#define debug(l) cerr<<#l<<' '<<l<<'\n';
#include "bits/stdc++.h"
using namespace std;
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;
vector<vector<int>> gr;
vector<int> d;
vector<vector<pii>> query;
void dfs(int v, int p) {
    if (p == -1) d[v] = 0;
    else d[v] = d[p] + 1;
    for (int& u : gr[v]) {
        if (u != p) {
            dfs(u, v);
        }
    }
}
vector<map<int, int>> dists;
vector<int> ans;
void dfs2(int v, int p) {
    dists[v][d[v]]++;
    for (int& u : gr[v]) {
        if (u != p) {
            dfs2(u, v);
            if (dists[v].size() < dists[u].size()) {
                dists[v].swap(dists[u]);
            }
            for (auto& j : dists[u]) {
                dists[v][j.first] += j.second;
            }
            dists[u].clear();
        }
    }
    for (auto&& [h, ind] : query[v]) {
        ans[ind] = dists[v][ h + d[v] ];
    }
}
signed main() {
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    cin >> n;
    gr.resize(n);
    d.resize(n);
    dists.resize(n);
    query.resize(n);
    for (int i = 1; i < n; i++) {
        int x;
        cin >> x;
        x--;
        gr[i].push_back(x);
        gr[x].push_back(i);
    }
    dfs(0, -1);
    int q;
    cin >> q;
    ans.resize(q);
    for (int i = 0; i < q; i++) {
        int v, h;
        cin >> v >> h;
        v--;
        query[v].push_back({ h,i });
    }
    dfs2(0, -1);
    for (int& i : ans) {
        cout << i << '\n';
    }
}