#include <bits/stdc++.h>
using namespace std;
int dfs(int u, int cnt, const vector<vector<int>> &g,
const vector<int> &r, const int r1, const int r2) {
int rt = 0;
if(r[u] == r1) {
cnt++;
}
if(r[u] == r2) {
rt += cnt;
}
for(auto v : g[u]) {
rt += dfs(v, cnt, g, r, r1, r2);
}
return rt;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, nr, q;
cin >> n >> nr >> q;
vector<int> a(n);
vector<int> r(n);
vector<vector<int>> g(n);
cin >> r[0];
for(int i = 1; i < n; i++) {
int from;
cin >> from;
from--;
g[from].push_back(i);
cin >> r[i];
}
for(int query = 1; query <= q; query++) {
int r1, r2;
cin >> r1 >> r2;
cout << dfs(0, 0, g, r, r1, r2) << '\n';
}
return 0;
}
