#include <bits/stdc++.h>
using namespace std;
int N;
bool root[100010];
vector<int> child[100010];
string name[100010];
map<string, int> mp;
int nameid[100010];
char buf[30];
int X;
int L[100010], R[100010], depth[100010];
vector<int> level[100010];
int Q;
int qroot[100010], qdepth[100010];
vector<pair<pair<int, int>, int> > queries;
int ans[100010];
int dfs(int x, int d) {
  int i;
  depth[x] = d;
  level[d].push_back(x);
  L[x] = X;
  X++;
  for ((i) = 0; (i) < (int)(child[x].size()); (i)++) dfs(child[x][i], d + 1);
  R[x] = X;
  X++;
}
int count_smaller(int depth, int bound) {
  int sz = level[depth].size();
  int low = 0, high = sz + 1;
  while (high - low > 1) {
    int mid = (high + low) / 2;
    if (L[level[depth][mid - 1]] < bound)
      low = mid;
    else
      high = mid;
  }
  return low;
}
map<pair<int, int>, int> cache;
bool used[100010];
int query(int root, int depth) {
  if (depth > 100005) return 0;
  pair<int, int> state = make_pair(root, depth);
  if (cache.find(state) != cache.end()) return cache[state];
  int low = count_smaller(depth, L[root]);
  int high = count_smaller(depth, R[root]);
  if (low >= high) return 0;
  int ans = 0;
  int i;
  for (i = low; i < high; i++) {
    int x = nameid[level[depth][i]];
    if (!used[x]) {
      ans++;
      used[x] = true;
    }
  }
  for (i = low; i < high; i++) {
    int x = nameid[level[depth][i]];
    used[x] = false;
  }
  return cache[state] = ans;
}
void solve(void) {
  int i;
  for ((i) = 0; (i) < (int)(N); (i)++)
    if (root[i]) dfs(i, 0);
  for ((i) = 0; (i) < (int)(Q); (i)++)
    ans[i] = query(qroot[i], qdepth[i] + depth[qroot[i]]);
}
int main(void) {
  int i;
  scanf("%d", &N);
  for ((i) = 0; (i) < (int)(N); (i)++) {
    scanf("%s", buf);
    name[i] = buf;
    int p;
    scanf("%d", &p);
    if (p == 0)
      root[i] = true;
    else
      child[p - 1].push_back(i);
  }
  scanf("%d", &Q);
  for ((i) = 0; (i) < (int)(Q); (i)++) {
    scanf("%d%d", &qroot[i], &qdepth[i]);
    qroot[i]--;
  }
  for ((i) = 0; (i) < (int)(N); (i)++) mp[name[i]] = 0;
  i = 0;
  for (__typeof((mp).begin()) itr = (mp).begin(); itr != (mp).end(); itr++) {
    (itr->second) = i;
    i++;
  }
  for ((i) = 0; (i) < (int)(N); (i)++) nameid[i] = mp[name[i]];
  solve();
  for ((i) = 0; (i) < (int)(Q); (i)++) printf("%d\n", ans[i]);
  return 0;
}
