//#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; #define SQRT 560 // 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; int tin[MAX]; vpii euler[25005]; int 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],node}); for(auto u : adj[node]){ if(u!=par) dfs(u,node); } tout[node]=timer-1; } 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); } } 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; vpii ans[25005];; for(int i=1;i<=25000;i++){ if(euler[i].size()<=SQRT) continue; for(int j=1;j<=25000;j++){ int tot=0; for(auto x : euler[i]){ int node=x.s; int l = lower_bound(euler[j].begin(),euler[j].end(),make_pair(tin[node],0))-euler[j].begin(); int r = upper_bound(euler[j].begin(),euler[j].end(),make_pair(tout[node],INF))-euler[j].begin(); tot+=r-l; } if(tot) ans[i].pb({j,tot}); } } while(q--){ int a,b; cin>>a>>b; if(euler[a].size()>SQRT){ auto itr = lower_bound(ans[a].begin(),ans[a].end(),make_pair(b,-1)); if(itr==ans[a].end() || (*itr).f!=b) cout<<"0\n"; else cout<<(*itr).s<<endl; } else{ int ans=0; for(auto u : euler[a]){ int node=u.s; int l = lower_bound(euler[b].begin(),euler[b].end(),make_pair(tin[node],0))-euler[b].begin(); int r = upper_bound(euler[b].begin(),euler[b].end(),make_pair(tout[node],INF))-euler[b].begin(); ans+=r-l; } cout<<ans<<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; }