#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pii pair<ll, ll>
#define mpr make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
const ll MXN = 2e5 + 5;
const ll MXR = 25e3 + 5;
const ll B = 3000;
ll n, r, q;
ll reg[MXN], p[MXN];
vector<ll> idx[MXR];
vector<pii> v1[MXR];
vector<ll> v2[MXR];
vector<ll> adj[MXN];
ll id[MXR], dp[MXN], in[MXN], out[MXN];
vector<vector<ll>> mp, mp1;
ll tim = -1;
ll cur = -1, curi = -1;
void dfs(ll a, ll p)
{
in[a] = ++tim;
for (ll v : adj[a])
{
if (v == p) continue;
dfs(v, a);
}
out[a] = ++tim;
}
void dfs1(ll a, ll p, ll seen)
{
dp[a] = 0;
mp[cur][reg[a]] = mp[cur][reg[a]] + seen;
for (ll v : adj[a])
{
if (v == p) continue;
dfs1(v, a, seen + (reg[a] == curi));
dp[a] += dp[v];
}
mp1[cur][reg[a]] = mp1[cur][reg[a]] + dp[a];
dp[a] += (reg[a] == curi);
}
signed main()
{
cin >> n >> r >> q;
cin >> reg[1];
idx[reg[1]].pb(1);
for (ll i = 2; i <= n; i++)
{
cin >> p[i] >> reg[i];
adj[p[i]].pb(i);
adj[i].pb(p[i]);
idx[reg[i]].pb(i);
}
dfs(1, 1);
for (ll i = 1; i <= r; i++)
{
for (ll x : idx[i])
{
v1[i].pb(mpr(in[x], 1));
v1[i].pb(mpr(out[x], -1));
v2[i].pb(in[x]);
}
sort(all(v1[i]));
sort(all(v2[i]));
}
ll cnt = 0;
for (ll i = 1; i <= r; i++)
{
if (idx[i].size() < B) continue;
id[i] = cnt++;
}
mp.resize(cnt + 1, vector<ll> (r + 1, 0));
mp1.resize(cnt + 1, vector<ll> (r + 1, 0));
for (ll i = 1; i <= r; i++)
{
if (idx[i].size() < B) continue;
curi = i;
cur = id[i];
dfs1(1, 1, 0);
}
while (q--)
{
ll u, v;
cin >> u >> v;
if (idx[u].size() >= B)
{
cout << mp[id[u]][v] << endl;
continue;
}
if (idx[v].size() >= B)
{
cout << ""<<mp1[id[v]][u] << endl;
continue;
}
ll i = 0;
ll j = 0;
ll ans = 0;
ll rn = 0;
while (i < v1[u].size() && j < v2[v].size())
{
if (v1[u][i].fi < v2[v][j]) rn += v1[u][i++].se;
else
{
ans = ans + rn;
j++;
}
}
cout << ans << endl;
}
}
