#include <bits/stdc++.h>
using namespace std;
long long n, q;
vector<vector<long long> > a(100005);
long long col[100005];
map<string, long long> enc;
long long peak = 0;
vector<pair<long long, long long> > query[100005];
long long sta[100005], en[100005], child[100005], ver[100005], Time = 0,
                                                               h[100005];
map<long long, long long> cur[100005];
long long ansQuery[100005];
void pdfs(long long u, long long p) {
  sta[u] = ++Time;
  ver[Time] = u;
  child[u] = 1;
  for (auto v : a[u]) {
    if (v == p) continue;
    h[v] = h[u] + 1;
    pdfs(v, u);
    child[u] += child[v];
  }
  en[u] = Time;
}
void dfs(long long u, long long p, bool keep) {
  pair<long long, long long> mx = make_pair(-1, -1);
  for (auto v : a[u]) {
    if (v == p) continue;
    mx = max(mx, make_pair(child[v], v));
  }
  for (auto v : a[u]) {
    if (v == p || v == mx.second) continue;
    dfs(v, u, 0);
  }
  if (mx.second != -1) dfs(mx.second, u, 1);
  for (auto v : a[u]) {
    if (v == p || v == mx.second) continue;
    for (long long i = sta[v]; i <= en[v]; i++) cur[h[ver[i]]][col[ver[i]]]++;
    ;
  }
  cur[h[u]][col[u]]++;
  ;
  for (auto it : query[u]) {
    ansQuery[it.second] = cur[it.first + h[u]].size();
  }
  if (!keep) {
    for (long long i = sta[u]; i <= en[u]; i++) {
      cur[h[ver[i]]][col[ver[i]]]--;
      if (cur[h[ver[i]]][col[ver[i]]] == 0) cur[h[ver[i]]].erase(col[ver[i]]);
    };
  }
}
vector<long long> allRoot;
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    string s;
    long long p;
    cin >> s >> p;
    if (enc[s] == 0) enc[s] = ++peak;
    if (p == 0) {
      allRoot.push_back(i);
      continue;
    }
    a[p].push_back(i);
    col[i] = enc[s];
  }
  cin >> q;
  for (long long i = 1; i <= q; i++) {
    long long u, k;
    cin >> u >> k;
    query[u].push_back(make_pair(k, i));
  }
  for (auto it : allRoot) pdfs(it, it), dfs(it, it, 0);
  for (long long i = 1; i <= q; i++) cout << ansQuery[i] << '\n';
  cerr << 1.0 * clock() / CLOCKS_PER_SEC << '\n';
}
