#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define F first
#define S second
#define forn(i, n) for(int i = 0; i < n; ++i)
#define forbn(i, b, n) for(int i = b; i < n; ++i)
#define sz(v) (int)v.size()
#define pb push_back
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define min3(a, b, c) min(a, min(b, c))
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long long ll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
template <class T> inline void mineq(T &a, T b) { a = min(a, b); }
template <class T> inline void maxeq(T &a, T b) { a = max(a, b); }
const int MX = 200 * 1000 + 10;
const int S = 500;
int n, R, Q;
vi gr[MX];
int e2r[MX];
vi r2es[MX];
int pc[S][MX];
int ct[MX];
vi regions;
bool cmp_reg(int r1, int r2) {
return sz(r2es[r1]) > sz(r2es[r2]);
}
void dfs(int node = 0) {
forn(i, min(R, S)) {
int r = regions[i];
pc[r][e2r[node]] += ct[r];
}
ct[e2r[node]] += 1;
for(int nb: gr[node]) {
dfs(nb);
}
ct[e2r[node]] -= 1;
}
void solve() {
cin >> n >> R >> Q;
forn(i, n) {
int r, p;
if(i == 0) {
cin >> r;
} else {
cin >> p >> r;
p -= 1;
gr[p].pb(i);
}
r--;
e2r[i] = r;
r2es[r].pb(i);
}
forn(i, R)
regions.pb(i);
// sort(all(regions), cmp_reg);
dfs();
forn(_, Q) {
int r1, r2;
cin >> r1 >> r2;
r1--; r2--;
cout << pc[r1][r2] << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
// freopen("haybales.in", "r", stdin);
// freopen("haybales.out", "w", stdout);
int t = 1;
// cin >> t;
while(t--) {
solve();
}
}
