#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long,long long>
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define pb push_back
#define sz(x) (int)(x).size()
#define rsz resize
#define ass assign
#define F(i,l,r) for(int i=(l);i<(r);++i)
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
template<typename T> using pqg = priority_queue<T, vector<T>, greater<T>>;
#define each(a,x) for(auto a:x)
#define FOR(i,a) for(int i=0;i<(a);i++)
#define ROF(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define eb emplace_back
#define ft front()
#define V vector
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif
void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(lld t) {cerr << t;}
void _print(double t) {cerr << t;}
void _print(ull t) {cerr << t;}
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
const int maxn=200005;
int n,r,q;
int h[maxn],s[maxn];
V<int> adj[maxn],nodesin[25005],tins_in[25005];
int tin[maxn],tout[maxn],timer=0,id[25005],cnt=0;
ll pre_down[450][25005],pre_up[25005][450];
void dfs(int u){
tin[u]=++timer;
each(v,adj[u])dfs(v);
tout[u]=timer;
}
void solve(){
cin>>n>>r>>q;
cin>>h[1];
nodesin[h[1]].pb(1);
F(i,2,n+1){
cin>>s[i]>>h[i];
adj[s[i]].pb(i);
nodesin[h[i]].pb(i);
}
dfs(1);
F(i,1,r+1){
each(node,nodesin[i])tins_in[i].pb(tin[node]);
sort(tins_in[i].begin(),tins_in[i].end());
if(sz(nodesin[i])>450)id[i]=++cnt;
}
int tmp[maxn];
F(rr,1,r+1){
if(id[rr]){
int idx=id[rr];
F(i,1,n+1){
tmp[i]=(i==1?0:tmp[s[i]]+(h[s[i]]==rr?1:0));
pre_down[idx][h[i]]+=tmp[i];
}
V<int> sub(n+1,0);
ROF(i,1,n+1){
if(h[i]==rr)sub[i]++;
if(i>1)sub[s[i]]+=sub[i];
}
F(i,1,n+1)pre_up[h[i]][idx]+=sub[i];
}
}
FOR(_,q){
int r1,r2;
cin>>r1>>r2;
if(id[r1])cout<<pre_down[id[r1]][r2]<<'\n';
else if(id[r2])cout<<pre_up[r1][id[r2]]<<'\n';
else{
ll res=0;
each(u,nodesin[r1]){
auto it1=lower_bound(tins_in[r2].begin(),tins_in[r2].end(),tin[u]);
auto it2=lower_bound(tins_in[r2].begin(),tins_in[r2].end(),tout[u]);
res+=distance(it1,it2);
}
cout<<res<<'\n';
}
}
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(nullptr);
#ifndef ONLINE_JUDGE
freopen("output.txt", "w", stdout);
freopen("input.txt", "r", stdin);
freopen("Error.txt", "w", stderr);
#endif
int tt=1;
//cin>>tt;
while(tt--)solve();
return 0;
}
