//#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
#define MAX 200005
#define pb push_back
// #define mp make_pair
// #define int long long
// #define double long double
#define f first
#define s second
#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define vpii vector<pair<int,int>>
const int mod = 1e9+7;
const int INF = 1e9;
// myMap.begin()->first : key
// myMap.begin()->second : value
int epow(int a,int b){int ans=1;while(b){if(b&1) ans*=a;a*=a;b>>=1;ans%=mod;a%=mod;}return ans%mod;}
int gcd(int a,int b) {if(a<b)swap(a,b);while(b){int tmp=b;b=a%b;a=tmp;}return a;}
int mul(int a,int b){return ((a%mod)*(b%mod))%mod;}
int sum(int a,int b){return ((a%mod)+(b%mod))%mod;}
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
// typedef
// tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_multiset;
vi euler[25005];
int tin[MAX],tout[MAX],timer=1,dep[MAX],type[MAX];
vi adj[MAX];
void dfs(int node,int par){
tin[node]=timer++; dep[node]=dep[par]+1;
euler[type[node]].pb(tin[node]);
for(auto u : adj[node]){
if(u!=par) dfs(u,node);
}
tout[node]=timer-1;
}
map<pii,int> calc;
set<int> st[MAX];
void dfs2(int node,int par){
for(auto u : adj[node]){
if(u==par) continue;
dfs2(u,node);
if(st[u].size()>st[node].size()) swap(st[node],st[u]);
for(auto x : st[u]) st[node].insert(x);
}
for(auto u : st[node]){
int l=lower_bound(euler[u].begin(),euler[u].end(),tin[node]+1)-euler[u].begin();
int r=upper_bound(euler[u].begin(),euler[u].end(),tout[node])-euler[u].begin();
// array<int,3> a={type[node],u,-1};
// auto itr = calc.lower_bound(a);
// if(itr==calc.end() || (*itr)[0]!=type[node] || (*itr)[1]!=u) calc.insert({type[node],u,r-l});
// else{
// int newval=(*itr)[2]+r-l;
// calc.erase(itr); calc.insert({{type[node],u,newval}});
// }
calc[{type[node],u}]+=r-l;
}
st[node].insert(type[node]);
}
void solve(){
int n,r,q; cin>>n>>r>>q;
cin>>type[1];
for(int i=2;i<=n;i++){
int p,tur; cin>>p>>tur; adj[p].pb(i); adj[i].pb(p); type[i]=tur;
}
dfs(1,0);
dfs2(1,0);
// for(auto u : calc) cout<<u[0]<<" "<<u[1]<<" "<<u[2]<<endl;
while(q--){
int a,b; cin>>a>>b; array<int,3> c={a,b,-1};
// auto itr = calc.lower_bound(c);
// if(itr==calc.end() || (*itr)[0]!=a || (*itr)[1]!=b) cout<<"0"<<endl;
// else cout<<(*itr)[2]<<endl;
cout<<calc[{a,b}]<<endl;
}
}
int32_t main(/*int32_t argc, char* argv[]*/){
std::ios_base::sync_with_stdio(0); std::cin.tie(0);
// freopen("promote.in", "r", stdin);
// freopen("promote.out", "w", stdout);
int t=1;
// cin >> t;
while (t--) solve();
return 0;
}
