#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
class Segment_Tree{
private:
int n;
vi date;
public:
Segment_Tree(int n_){
n=1;
while(n<n_) n*=2;
date=vi(2*n-1);
}
void Update(int k,int x){
k+=n-1;
date[k]+=x;
while(k>0){
k=(k-1)/2;
date[k]=date[k*2+1]+date[k*2+2];
}
}
int Query(int a,int b){
a+=n-1;b+=n-1;
int m=0;
while(a<b){
if(a%2==0) m+=date[a++];
if(b%2==0) m+=date[--b];
a/=2;b/=2;
}
return m;
}
int Open(int k){return date[k+n-1];}
};
const int M=300;
int n,m,q,id=0;
vvi g,b;
vi a,par,num,lt,rt;
map<P,int> mp;
void dfs(int v){
lt[v]=id++;
for(auto u:g[v]) dfs(u);
rt[v]=id;
}
int main(){
scanf("%d%d%d",&n,&m,&q);
Segment_Tree st(n);
g=vvi(n);
b=vvi(m);
a=lt=rt=vi(n);
par=vi(n,-1);
num=vi(m);
for(int i=0;i<n;i++){
if(i){
scanf("%d",&par[i]);
par[i]--;
g[par[i]].push_back(i);
}
scanf("%d",&a[i]);
a[i]--;
num[a[i]]++;
b[a[i]].push_back(i);
}
dfs(0);
/* for(int i=0;i<m;i++) if(a[i]>M){
}*/
for(int i=0;i<q;i++){
int x,y,res=0;
scanf("%d%d",&x,&y);
x--,y--;
if(mp.find({x,y})!=mp.end()) res=mp[{x,y}];
else{
for(auto j:b[y]) st.Update(lt[j],1);
for(auto j:b[x]) res+=st.Query(lt[j],rt[j]);
for(auto j:b[y]) st.Update(lt[j],-1);
}
mp[{x,y}]=res;
printf("%d\n",res);
fflush(stdout);
}
}
