#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, M = N << 1;
int n, q, u, v, k, lca, edgenum, Head[N], Next[M], vet[M], ans[N];
int fa[N], dep[N], siz[N], son[N], top[N];
int mx, tree[N], P, id[N], val[N], tag[N], tot, cg, Max[N], _mx, buc[N], exc[N], vis[N], cur, stk[N], le[N], ri[N];
struct qry { int a, b, c; } ; basic_string <qry> hpath[N], subtree[N], single[N];
int read() {
	int s = 0; char ch = getchar();
	while (ch < '0' || ch > '9') ch = getchar();
	while (ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
	return s;
}
void write(int x) {
	if (x > 9) write(x / 10);
	putchar(x % 10 + '0');
}
void add(int u, int v) {
	Next[++edgenum] = Head[u];
	Head[u] = edgenum;
	vet[edgenum] = v;
}
void dfs1(int u, int f) {
	fa[u] = f, dep[u] = dep[f] + 1, siz[u] = 1;
	for (int e=Head[u]; e; e=Next[e]) {
		int v=vet[e];
		if (v ^ f) {
			dfs1(v, u), siz[u] += siz[v];
			if (siz[v] > siz[son[u]]) son[u] = v;
		}
	}
}
void dfs2(int u, int t) {
	top[u] = t;
	if (son[u]) dfs2(son[u], t);
	for (int e=Head[u]; e; e=Next[e]) {
		int v=vet[e];
		if (v != fa[u] && v != son[u])
			dfs2(v, v);
	}
}
int getlca(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;
}
void addq(int u, int k, int i, int c) {
	ans[i] += c * dep[u];
	while (u) {
		if (son[u] && k) subtree[son[u]] += (qry) {k - 1, i, c};
		hpath[u] += (qry) {k, i, c};
		if (fa[u=top[u]] && k) subtree[u] += (qry) {k - 1, i, - c};
		u = fa[u];
	}
}
void update(int s) {
	for (; s<=n; s+=s&-s) tree[s] ++;
}
int getsum(int s) {
	int res = 0;
	for (; s; s-=s&-s) res += tree[s];
	return res;
}
void clear(int s) {
	for (; s<=n && tree[s]; s+=s&-s) tree[s] = 0;
}
void dfs3(int u, int d) {
	mx = max(mx, d), update(d);
	for (int e=Head[u]; e; e=Next[e])
		if (vet[e] ^ fa[u])
			dfs3(vet[e], d + 1);
}
void solvehpath(int u) {
	int _ = u; mx = 0;
	for (; u; u=son[u]) {
		for (int e=Head[u]; e; e=Next[e]) {
			int v=vet[e];
			if (v == fa[u] || v == son[u]) continue;
			dfs3(v, 1);
		}
		for (qry t : hpath[u])
			ans[t.b] += t. c * getsum(t. a);
	}
	for (int i=1; i<=mx; i++) clear(i);
	for (u=_; u; u=son[u])
		for (int e=Head[u]; e; e=Next[e]) {
			int v=vet[e];
			if (v != fa[u] && v != son[u])
				solvehpath(v);
		}
}
void dfs4(int u) {
	dep[u] = son[u] = 0;
	for (int e=Head[u]; e; e=Next[e]) {
		int v=vet[e];
		if (v ^ fa[u]) {
			dfs4(v), dep[u] = max(dep[u], dep[v] + 1);
			if (dep[v] > dep[son[u]]) son[u] = v;
		}
	}
}
void solvesubtree(int u) {
	if (! id[u]) id[u] = P + 1, P += dep[u] + 1;
	if (son[u]) id[son[u]] = id[u] + 1, solvesubtree(son[u]);
	tag[u] = tag[son[u]];
	for (int e=Head[u]; e; e=Next[e]) {
		int v=vet[e];
		if (v == fa[u] || v == son[u]) continue;
		solvesubtree(v), tag[u] += tag[v] + val[id[v]+dep[v]];
		for (int i=0; i<=dep[v]; i++)
			val[id[u]+i+1] += val[id[v]+i] - val[id[v]+dep[v]];
	} val[id[u]] = 1 - tag[u];
	for (qry t : subtree[u])
		ans[t.b] += t. c * (val[id[u]+min(t.a,dep[u])] + tag[u]);
}
#define find(u,s) (tot = s, cg = 0, getroot(u, 0), cg)
void getroot(int u, int fa) {
	siz[u] = 1;
	for (int e=Head[u]; e; e=Next[e]) {
		int v=vet[e];
		if (v != fa && ! vis[v]) {
			getroot(v, u), siz[u] += siz[v];
			Max[u] = max(Max[u], siz[v]);
		}
	} Max[u] = max(Max[u], tot - siz[u]);
	if (Max[u] < Max[cg]) cg = u;
}
void dfs5(int u, int fa, int d) {
	mx = max(mx, d), stk[++cur] = d, buc[d] ++;
	for (int e=Head[u]; e; e=Next[e]) {
		int v=vet[e];
		if (v != fa && ! vis[v])
			dfs5(v, u, d + 1);
	}
}
void dfs6(int u, int fa, int d) {
	for (qry t : single[u])
		if (t. a >= d)
			ans[t.b] += t. c * (buc[min(t.a-d,mx)] - exc[min(t.a-d,_mx)]);
	siz[u] = 1;
	for (int e=Head[u]; e; e=Next[e]) {
		int v=vet[e];
		if (v != fa && ! vis[v])
			dfs6(v, u, d + 1), siz[u] += siz[v];
	}
}
void solvesingle(int u) {
	vis[u] = 1, stk[cur=1] = 0, buc[mx=0] = 1;
	for (int e=Head[u]; e; e=Next[e]) {
		int v=vet[e];
		if (vis[v]) continue;
		le[v] = cur + 1, dfs5(v, u, 1), ri[v] = cur;
	}
	for (int i=1; i<=mx; i++) buc[i] += buc[i-1];
	for (qry t : single[u]) ans[t.b] += t. c * buc[min(t.a,mx)];
	for (int e=Head[u]; e; e=Next[e]) {
		int v=vet[e];
		if (vis[v]) continue;
		_mx = 0;
		for (int i=le[v]; i<=ri[v]; i++) _mx = max(_mx, stk[i]), exc[stk[i]] ++;
		for (int i=1; i<=_mx; i++) exc[i] += exc[i-1];
		dfs6(v, u, 1);
		for (int i=1; i<=_mx; i++) exc[i] = 0;
	}
	for (int i=0; i<=mx; i++) buc[i] = 0;
	for (int e=Head[u]; e; e=Next[e]) {
		int v=vet[e];
		if (! vis[v]) solvesingle(find(v, siz[v]));
	}
}
int main() {
	n = read();
	for (int i=1; i<n; i++)
		u = read(), v = read(), add(u, v), add(v, u);
	dfs1(1, 0), dfs2(1, 1);
	q = read();
	for (int i=1; i<=q; i++) {
		u = read(), v = read(), k = read(), lca = getlca(u, v);
		if (v == lca) swap(u, v);
		if (u ^ v)
			if (u ^ lca) addq(u, k, i, 1), addq(v, k, i, 1), addq(lca, k, i, - 2);
			else addq(v, k, i, 1), addq(u, k, i, - 1);
		single[lca] += (qry) {k, i, 1};
	}
	solvehpath(1);
	dfs4(1), solvesubtree(1);
	Max[0] = 1e9, solvesingle(find(1, n));
	for (int i=1; i<=q; i++)
		write(ans[i]), putchar('\n');
}