#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define pii pair < int, int >
#define vi vector < int >

#define L(i, a, b) for (int i = (a); i <= (b); i++)
#define R(i, a, b) for (int i = (a); i >= (b); i--)
#define sz(a) ((int) a.size())
#define pb push_back
#define eb emplace_back
#define me(a, x) memset(a, x, sizeof(a))

void solve() {
	int n;
	cin >> n;
	vector<vi> p(100001);
	L(i, 1, n) {
		int A, B;
		cin >> A >> B;
		p[0].pb(A);
		p[B].pb(A);
	}
	L(i, 0, 1e5) sort(p[i].begin(), p[i].end());
	int q;
	cin >> q;
	while (q--) {
		int X, Y;
		cin >> X >> Y;
		int cnt1 = upper_bound(p[0].begin(), p[0].end(), X) - p[0].begin();
		int cnt2 = upper_bound(p[Y].begin(), p[Y].end(), X) - p[Y].begin();
		cout << cnt1 - cnt2 << '\n';
	}
}

int main() {
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int T = 1;
//	cin >> T;
	while (T--) solve();
}