#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 2e5 + 10;
const int SQRT = 512;
vector<int> adj[MAXN];
int n, r, q;
int cnt[SQRT];
int tot[SQRT][SQRT], reg[MAXN], sup[MAXN];
void dfs_sub_1(int v) {
for (int i = 1; i <= r; i++) {
tot[i][reg[v]] += cnt[i];
}
cnt[reg[v]]++;
for (int w: adj[v]) {
dfs_sub_1(w);
}
cnt[reg[v]]--;
}
void solve_sub_1() {
dfs_sub_1(1);
while (q--) {
int x, y;
cin >> x >> y;
cout << tot[x][y] << endl;
}
}
vector<int> pos[MAXN], vals[MAXN];
int tin[MAXN], tout[MAXN], tcur;
void dfs_sub_2(int v) {
tin[v] = ++tcur;
pos[reg[v]].push_back(tin[v]);
vals[reg[v]].push_back(v);
for (int w: adj[v]) {
dfs_sub_2(w);
}
tout[v] = tcur;
}
int query(int l, int r, int x) {
auto it_l = lower_bound(pos[x].begin(), pos[x].end(), l);
auto it_r = upper_bound(pos[x].begin(), pos[x].end(), r);
return it_r - it_l;
}
void solve_sub_2() {
dfs_sub_2(1);
while (q--) {
int x, y;
cin >> x >> y;
int resp = 0;
for (int v: vals[x]) {
resp += query(tin[v], tout[v], y);
}
cout << resp << endl;
}
}
void solve() {
cin >> n >> r >> q;
cin >> reg[1];
for (int i = 2; i <= n; i++) {
cin >> sup[i] >> reg[i];
adj[sup[i]].push_back(i);
}
if (r <= 500) {
solve_sub_1();
} else {
solve_sub_2();
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
