#include <bits/stdc++.h>

#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define pre(i, a, b) for(int i = (a); i >= (b); i--)
#define Ede(i, u) for(int i = h[u]; i; i = ne[i])
#define go(i, a) for(auto i : a)
//#define int long long
#define uint unsigned int
#define LL long long
#define ULL unsigned long long
#define PII pair<int, int>
#define PIL pair<int, LL>
#define PLI pair<LL, int>
#define PLL pair<LL, LL>
#define mp make_pair
#define eb emplace_back
#define opb pop_back
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define sf scanf
#define prf printf
#define el putchar('\n')
#define mms(arr, n) memset(arr, n, sizeof(arr))
#define mmc(arr1, arr2) memcpy(arr1, arr2, sizeof(arr2))
#define Db(x) prf("test(%s): ", x)
const int inf = 0x3f3f3f3f;

template <typename T> inline void rd(T &x){
	x = 0; bool f = true; char ch = getchar();
	while(ch < '0' || ch > '9'){ if(ch == '-') f = false; ch = getchar();}
	while(ch >= '0' && ch <= '9'){ x = (x << 1) + (x << 3) + (ch ^ '0'); ch = getchar();}
	if(!f) x = -x;
}
template <typename T, typename ...Args> inline void rd(T &x, Args &...args){ rd(x); rd(args...);}

using namespace std;

const int N = 2e5 + 10, M = N << 1;
int n;
int sum[N];
int h[N], e[M], ne[M], idx;
void add(int a, int b){
	e[++idx] = b, ne[idx] = h[a], h[a] = idx;
}
void init(){
	rep(i, 1, n) sum[i] = 0;
	rep(i, 1, idx) e[i] = ne[i] = h[i] = 0;
	idx = 0;
}
void dfs(int u, int f){
	int F = 0;
	Ede(i, u){
		int v = e[i];
		if(v == f) continue;
		F = 1;
		dfs(v, u);
		sum[u] += sum[v];
	}
	if(!F) sum[u] = 1;
}

int main(){
	/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
	*/
	int T; rd(T);
	while(T--){
		rd(n);
		rep(i, 1, n-1){
			int x, y; rd(x, y);
			add(x, y), add(y, x);
		}
		dfs(1, 0);
		int q; rd(q);
		rep(i, 1, q){
			int x, y; rd(x, y);
			prf("%d\n", sum[x] * sum[y]);
		}
		init(n);
	}

	return 0;
}