#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC target("popcnt")
using namespace std;
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
using vlld = vector<lld>;
// #define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)
bool cmin(ll &a, ll b) { if(b<a){a=b;return 1;}return 0; }
bool cmax(ll &a, ll b) { if(b>a){a=b;return 1;}return 0; }
void valid(ll in) { cout<<((in)?"YES\n":"NO\n"); }
ll lcm(ll a, ll b) { return (a/gcd(a,b))*b; }
ll gauss(ll n) { return (n*(n+1))/2; }
const int N = 2e5 + 7;
int pa[N], h[N], el[N], tin[N], tout[N], timer, n, r, Q;
vi graph[N];
map<int, int> rd[N];
int ft[N];
void update(int i, int v) { for(; i<n+2; i+=lsb(i)) ft[i] += v; }
int query(int i) { int r = 0; for(; i>0; i-=lsb(i)) r += ft[i]; return r; }
void test_case() {
cin >> n >> r >> Q;
vector<vi> ord(r+1);
cin >> h[1];
fore (i, 2, n+1) {
cin >> pa[i];
graph[pa[i]].pb(i);
cin >> h[i];
}
if (r <= 500) {
vector<vi> dp(501, vi(501, 0));
function<void(int)> dfs = [&](int u) {
rd[u][h[u]]++;
for(int v: graph[u]) {
dfs(v);
if(sz(rd[v]) > sz(rd[u])) swap(rd[u], rd[v]);
for (auto [k, vl]: rd[v]) {
rd[u][k] += vl;
}
}
for (auto [k, vl]: rd[u]) dp[h[u]][k] += vl;
};
dfs(1);
while (Q--) {
int r1, r2;
cin >> r1 >> r2;
cout << dp[r1][r2] << endl;
}
return;
}
// int mx = 0;
// fore (i, 1, r+1) mx = max(mx, sz(ord[i]));
// assert(mx <= 500);
timer = 1;
function<void(int)> dfs = [&](int u) {
el[timer]=u;
ord[h[u]].pb(u);
tin[u] = timer++;
for(int v: graph[u]) dfs(v);
tout[u] = timer-1;
};
dfs(1);
while (Q--) {
int r1, r2;
cin >> r1 >> r2;
int ans = 0, l = 0;
fo (i, sz(ord[r2])) update(tout[ord[r2][i]], +1);
fo (i, sz(ord[r1])) {
while(l < sz(ord[r2]) && tin[ord[r2][l]] < tin[ord[r1][i]]) {
update(tout[ord[r2][l]], -1);
l++;
}
ans += query(tout[ord[r1][i]]);
}
fore(i, l, sz(ord[r2])) update(tout[ord[r2][i]], -1);
cout << ans << endl;
}
}
int main() {
int tt = 1;
// cin >> tt;
while(tt--) test_case();
}
