#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define MP make_pair
#define fir first
#define sec second
using namespace std;
const int maxn = 2e5 + 5, inf = 0x3f3f3f3f;
template <typename T>
void read(T &x) {
	T sgn = 1;
	char ch = getchar();
	for (; !isdigit(ch); ch = getchar()) if (ch == '-') sgn = -1;
	for (x = 0; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
	x *= sgn;
}
template <typename T>
void write(T x) {
	if (x > 9) write(x / 10);
	putchar(x % 10 + '0');
}
template <typename T>
void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	write(x); putchar('\n');
}
bool _;
int n, m, ans[maxn], top[maxn], fa[maxn], son[maxn], sz[maxn], dep[maxn], D[maxn], rt, mn, anc[maxn];
int Rt[maxn], val[maxn << 5], ls[maxn << 5], rs[maxn << 5], tot;
int stk[maxn], num, c[maxn];
vector<int> vec[maxn], q3[maxn];
vector<pii> q[maxn], q2[maxn];
bool vis[maxn];
int bit[maxn];
bool __;
void add(int x, int v) { while (x <= n) bit[x] += v, x += x & -x; }
int qry(int x) { int ret = 0; while (x) ret += bit[x], x -= x & -x; return ret; }
void dfs1(int u) {
	sz[u] = 1;
	for (int v : vec[u]) {
		if (v == fa[u]) continue;
		fa[v] = u; dep[v] = dep[u] + 1;
		dfs1(v);
		sz[u] += sz[v];
		if (sz[v] > sz[son[u]]) son[u] = v;
	}
}
void dfs2(int u, int chain) {
	top[u] = chain;
	if (son[u]) dfs2(son[u], chain);
	for (int v : vec[u]) {
		if (v == fa[u] || v == son[u]) continue;
		dfs2(v, v);
	}
}
int LCA(int u, int v) {
	while (top[u] != top[v]) {
		if (dep[top[u]] < dep[top[v]]) swap(u, v);
		u = fa[top[u]];
	}
	return dep[u] < dep[v] ? u : v;
}
int dis(int u, int v) {
	return dep[u] + dep[v] - dep[LCA(u, v)] * 2;
}
void get_rt(int u, int ff, int ts) {
	sz[u] = 1;
	int mx = -inf;
	for (int v : vec[u]) {
		if (vis[v] || v == ff) continue;
		get_rt(v, u, ts);
		sz[u] += sz[v];
		mx = max(mx, sz[v]);
	}
	mx = max(mx, ts - sz[u]);
	if (mn > mx) rt = u, mn = mx;
}
void dfs3(int u, int ff, int d) {
	c[d]++;
	for (int v : vec[u]) {
		if (vis[v] || v == ff) continue;
		dfs3(v, u, d + 1);
	}
}
int MX;
void get_ans(int u, int ff, int op, int d) {
	for (int x : q3[u]) if (D[x] >= d) ans[x] += op * c[min(MX, D[x] - d)];
	for (int v : vec[u]) {
		if (vis[v] || v == ff) continue;
		get_ans(v, u, op, d + 1);
	}
}
void solve(int u, int ts) {
	vis[u] = 1;
	for (int i = 0; i <= ts; i++) c[i] = 0;
	dfs3(u, 0, 0);
	for (int i = 1; i <= ts; i++) c[i] += c[i - 1];
	MX = ts;
	get_ans(u, 0, 1, 0);
	for (int v : vec[u]) {
		if (vis[v]) continue;
		int tmp = (sz[u] < sz[v]) ? ts - sz[u] : sz[v];
		for (int i = 0; i <= tmp; i++) c[i] = 0;
		dfs3(v, u, 1);
		for (int i = 1; i <= tmp; i++) c[i] += c[i - 1];
		MX = tmp;
		get_ans(v, u, -1, 1);
	}
	for (int v : vec[u]) {
		if (vis[v]) continue;
		mn = inf; get_rt(v, u, (sz[u] < sz[v]) ? ts - sz[u] : sz[v]); anc[rt] = u;
		solve(rt, sz[v]);
	}
}
void ins(int x, int id, int op) {
	ans[id] += dep[x] * op;
	while (x) {
		q[x].eb(id, op);
		x = top[x];
		if (x != 1) q2[x].eb(id, -op);
		x = fa[x];
	}
}
void mdf(int &p, int l, int r, int pos, int v) {
	if (!p) p = ++tot;
	if (l == r) return val[p] += v, void();
	int mid = (l + r) >> 1;
	(pos <= mid) ? mdf(ls[p], l, mid, pos, v) : mdf(rs[p], mid + 1, r, pos, v);
	val[p] = val[ls[p]] + val[rs[p]];
}
int ask(int p, int l, int r, int x, int y) {
	if (!p || l > y || r < x) return 0;
	if (x <= l && r <= y) return val[p];
	int mid = (l + r) >> 1;
	return ask(ls[p], l, mid, x, y) + ask(rs[p], mid + 1, r, x, y);
}
int Merge(int u, int v) {
	if (!u || !v) return u | v;
	val[u] += val[v];
	ls[u] = Merge(ls[u], ls[v]);
	rs[u] = Merge(rs[u], rs[v]);
	return u;
}
void dfs4(int u) {
	for (int v : vec[u]) {
		if (v == fa[u]) continue;
		dfs4(v);
	}
	if (son[u]) for (auto x : q[u]) ans[x.fir] += x.sec * ask(Rt[son[u]], 1, n, 1, min(n, dep[son[u]] + D[x.fir] - 1));
	mdf(Rt[u], 1, n, dep[u], 1);
	for (int v : vec[u]) {
		if (v == fa[u]) continue;
		Rt[u] = Merge(Rt[u], Rt[v]);
	}
	for (auto x : q2[u]) ans[x.fir] += x.sec * ask(Rt[u], 1, n, 1, min(n, dep[u] + D[x.fir] - 1));
}
void clear() { for (int i = 1; i <= num; i++) add(stk[i], -1); num = 0; }
void dfs6(int u, int id) {
	stk[++num] = dep[u] - dep[id];
	add(stk[num], 1);
	for (int v : vec[u]) {
		if (v == fa[u]) continue;
		dfs6(v, id);
	}
}
void dfs5(int u) {
	for (int v : vec[u]) {
		if (v == fa[u] || v == son[u]) continue;
		dfs6(v, u);
	}
	for (auto x : q[u]) ans[x.fir] += x.sec * qry(min(D[x.fir], n));
	if (son[u]) dfs5(son[u]);
	for (int v : vec[u]) {
		if (v == fa[u] || v == son[u]) continue;
		clear(); dfs5(v);
	}
}
int main() {
	read(n);
	for (int i = 1, u, v; i < n; i++) {
		read(u); read(v);
		vec[u].pb(v); vec[v].pb(u);
	}
	read(m);
	dep[1] = 1; dfs1(1); dfs2(1, 1);
	for (int i = 1, x, y, z; i <= m; i++) {
		read(x); read(y); read(D[i]);
		z = LCA(x, y);
		q3[z].pb(i);
		ins(x, i, 1); ins(y, i, 1); ins(z, i, -2);
	}
	mn = inf; get_rt(1, 0, n); solve(rt, n);
	dfs4(1); dfs5(1);
	for (int i = 1; i <= m; i++) printf("%d\n", ans[i]);
	return 0;
}