#include <bits/stdc++.h>
using namespace std;
string S[100005];
vector<int> V[100005];
int as[200005], q[200005];
struct tree {
  set<string> T[200005];
  int hd[100005], vr[200005], nt[200005], tt;
  int sz[100005], bg[100005], vs[100005], de[100005], mx[100005];
  void push(int x, int y) {
    vr[++tt] = y;
    nt[tt] = hd[x];
    hd[x] = tt;
  }
  void dfs1(int nw, int en) {
    mx[nw] = de[nw] = de[en] + 1;
    sz[nw] = 1;
    for (int i = hd[nw]; i; i = nt[i]) {
      if (vr[i] == en) continue;
      dfs1(vr[i], nw);
      sz[nw] += sz[vr[i]];
      mx[nw] = max(mx[nw], mx[vr[i]]);
      if (bg[nw] == 0 || sz[bg[nw]] < sz[vr[i]]) bg[nw] = vr[i];
    }
    vs[bg[nw]] = 1;
  }
  void dfs2(int nw, int en, int op) {
    if (op) {
      for (int i = hd[nw]; i; i = nt[i]) {
        if (vr[i] == en || vr[i] == bg[nw]) continue;
        dfs2(vr[i], nw, 1);
      }
    }
    if (bg[nw]) dfs2(bg[nw], nw, op);
    for (int i = hd[nw]; i; i = nt[i]) {
      if (vr[i] == en || vr[i] == bg[nw]) continue;
      dfs2(vr[i], nw, 0);
    }
    T[de[nw]].insert(S[nw]);
    if (op) {
      for (int i = (0); i < (V[nw].size()); ++i) {
        as[V[nw][i]] = T[q[V[nw][i]] + de[nw]].size();
      }
    }
    if (vs[nw] || op == 0) return;
    for (int i = (de[nw]); i <= (mx[nw]); ++i) T[i].clear();
  }
} T;
int n, fa[100005], rt, m, x, y;
int main() {
  scanf("%d", &n);
  for (int i = (1); i <= (n); ++i) {
    cin >> S[i];
    scanf("%d", &fa[i]);
    if (fa[i]) T.push(fa[i], i);
  }
  scanf("%d", &m);
  for (int i = (1); i <= (m); ++i) {
    scanf("%d%d", &x, &y);
    q[i] = y;
    V[x].push_back(i);
  }
  for (int i = (1); i <= (n); ++i) {
    if (fa[i]) continue;
    T.dfs1(i, 0);
    T.dfs2(i, 0, 1);
  }
  for (int i = (1); i <= (m); ++i) printf("%d\n", as[i]);
  return 0;
}
