// Om Namah Shivaya
#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;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
const int B = 155;
int n, r, q;
vector<int> adj[N];
vector<int> a(N);
vector<int> id(N, -1);
vector<int> curr_cnt(N);
vector<vector<int>> ans_heavy;
int siz;
vector<int> tin(N), tout(N);
int timer = 1;
void dfs(int u, int p) {
tin[u] = timer++;
ll c = a[u];
if (id[c] != -1) {
curr_cnt[id[c]]++;
}
rep(id, siz) {
ans_heavy[id][c] += curr_cnt[id];
}
trav(v, adj[u]) {
if (v == p) conts;
dfs(v, u);
}
if (id[c] != -1) {
curr_cnt[id[c]]--;
}
tout[u] = timer++;
}
vector<int> nodes[N];
vector<int> tins[N];
void solve(int test_case)
{
cin >> n >> r >> q;
cin >> a[1];
for (int i = 2; i <= n; ++i) {
int p, h; cin >> p >> h;
adj[p].pb(i);
a[i] = h;
}
vector<int> cnt(r + 5);
rep1(i, n) cnt[a[i]]++;
siz = 0;
rep1(c, r) {
if (cnt[c] > B) {
id[c] = siz++;
}
}
ans_heavy = vector<vector<int>>(siz, vector<int>(r + 5));
dfs(1, -1);
rep1(i, n) {
nodes[a[i]].pb(i);
tins[a[i]].pb(tin[i]);
}
rep1(c, r) {
sort(all(tins[c]));
}
while (q--) {
int c1, c2; cin >> c1 >> c2;
int ans = 0;
if (id[c1] != -1) {
ans = ans_heavy[id[c1]][c2];
}
else {
auto &ti = tins[c2];
trav(u, nodes[c1]) {
int l = tin[u], r = tout[u];
int cnt = upper_bound(all(ti), r) - lower_bound(all(ti), l);
ans += cnt;
}
}
cout << ans << endl;
}
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
