#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
int n, q;
string st[N + 10];
vector<int> xw[N + 10], xb[N + 10];
int son[N * 2 + 10], head[N + 10], nxt[N * 2 + 10], tot, f[N + 10];
void add(int x, int y) { son[++tot] = y, nxt[tot] = head[x], head[x] = tot; }
int sz[N + 10], dep[N + 10];
int ans[N + 10];
int bs[N + 10], bigson;
int len[N + 10];
map<string, bool> t[N + 10];
bool vis[N + 10];
void tadd(int x, int p) {
  if (p == 1 && !t[dep[x]][st[x]]) t[dep[x]][st[x]] = 1, len[dep[x]]++;
  if (p == -1) t[dep[x]].clear(), len[dep[x]] = 0;
  for (int i = head[x]; i; i = nxt[i])
    if (son[i] != bigson) tadd(son[i], p);
}
void dfs(int x, bool ke) {
  vis[x] = 1;
  for (int i = head[x]; i; i = nxt[i])
    if (son[i] != bs[x]) dfs(son[i], 0);
  if (bs[x]) dfs(bs[x], 1), bigson = bs[x];
  tadd(x, 1);
  bigson = 0;
  int len_ = xb[x].size();
  for (int i = 0; i < len_; i++) ans[xb[x][i]] = len[xw[x][i] + dep[x]];
  if (ke == 0) tadd(x, -1);
}
void dfs1(int x, int fa) {
  sz[x] = 1, dep[x] = dep[fa] + 1;
  int mx = -1;
  for (int i = head[x]; i; i = nxt[i]) {
    dfs1(son[i], x);
    sz[x] += sz[son[i]];
    if (sz[son[i]] > mx) {
      mx = sz[son[i]];
      bs[x] = son[i];
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1, x; i <= n; i++) {
    cin >> st[i];
    scanf("%d", &f[i]);
    if (f[i] != 0) add(f[i], i);
  }
  for (int i = 1; i <= n; i++)
    if (f[i] == 0) dfs1(i, 0);
  scanf("%d", &q);
  for (int i = 1, x, y; i <= q; i++) {
    scanf("%d %d", &x, &y);
    if (dep[x] + y <= n) xw[x].push_back(y), xb[x].push_back(i);
  }
  for (int i = 1; i <= n; i++)
    if (f[i] == 0) dfs(i, 0);
  for (int i = 1; i <= q; i++) printf("%d\n", ans[i]);
  return 0;
}
