#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define MOD 1000000007
#define LOGN 20
#define MAXN 200005
#define pb push_back
vector<vector<int>> graph;
int region[MAXN];
int ans[505][505], cnt[505][505];
void dfs(int node, int parent) {
for (int i = 0; i <= 500; i++) {
cnt[node][i] = cnt[parent][i];
ans[i][region[node]] += cnt[node][i];
}
cnt[node][region[node]]++;
for (auto u : graph[node]) {
dfs(u, node);
}
}
int main() {
fast
int N, R, Q, S, r1, r2;
cin >> N >> R >> Q >> region[1];
graph = vector<vector<int>>(N+1, vector<int>());
for (int i = 2; i <= N; i++) {
cin >> S >> region[i];
graph[S].pb(i);
}
if (R <= 500) {
dfs(1, 1);
while (Q--) {
cin >> r1 >> r2;
cout << ans[r1][r2] << endl;
}
} else {
}
}
