#include <bits/stdc++.h>
#define X first
#define Y second
#define MP make_pair
#define ll long long
using namespace std;
const int N = 2e5 + 12, BS = 300, M = 1340;
const ll INF = 1e18;
int n, m, q, timer, rv[N], cl[N];
ll ans1[M][25001], ans2[M][25001];
vector< int > g[N];
vector< pair<int, int> > his[N];
void dfs(int v){
his[cl[v]].push_back(MP(++timer, 1));
for(int to: g[v]){
dfs(to);
}
his[cl[v]].push_back(MP(++timer, -1));
}
void dfs2(int v, int pa, int p1 = 0, int p2 = 0){
p1 += cl[v] == pa, p2 += cl[v] != pa;
ans1[rv[pa]][cl[v]] += p1;
ans2[rv[pa]][cl[v]] += p2;
for(int to: g[v]){
dfs2(to, pa, p1, p2);
}
p1 -= cl[v] == pa, p2 -= cl[v] != pa;
}
ll calc(int x, int y){
int i = 0, j = 0, tmp = 0;
ll r = 0;
while(i < his[x].size() && j < his[y].size()){
if(i < his[x].size() && (j == his[y].size() || his[x][i].X < his[y][j].X))
tmp += his[x][i++].Y;
else{
r += (his[y][j++].Y == 1 ? tmp: 0);
}
}
return r;
}
int main () {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> m >> q >> cl[1];
for(int i = 2, x;i <= n;i++){
cin >> x >> cl[i];
g[x].push_back(i);
}
dfs(1);
for(int i = 1, z = 0;i <= m;i++){
if(his[i].size() >= BS){
rv[i] = ++z;
dfs2(1, rv[i]);
}
}
for(int i = 1, x, y;i <= q;i++){
cin >> x >> y;
if(rv[x])
cout << ans1[rv[x]][y] << endl;
else if(rv[y])
cout << ans2[rv[y]][x] << endl;
else
cout << calc(x, y) << endl;
}
}
