#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> P;
#define fi first
#define se second

const int N = 2e5 + 5;

int n, m;
vector<int> G[N];
vector<P> q1[N], q2[N], q3[N];
struct Qry {int d, w, id;};
vector<Qry> q[N];
int ans[N];

int fa[N], dep[N], siz[N], son[N];
int tim, st[N], ed[N], top[N], id[N];

void dfs1(int u, int f)
{
	fa[u] = f, dep[u] = dep[f] + 1, siz[u] = 1;
	for(auto v : G[u])
	{
		if(v == f) continue;
		dfs1(v, u);
		siz[u] += siz[v];
		if(siz[v] > siz[son[u]]) son[u] = v;
	}
	return;
}

void dfs2(int u, int tp)
{
	top[u] = tp, st[u] = ++tim, id[tim] = u;
	if(son[u]) dfs2(son[u], tp);
	for(auto v : G[u])
		if(v != fa[u] && v != son[u]) dfs2(v, v);
	ed[u] = tim;
	return;
}

int LCA(int x, int y)
{
	while(top[x] != top[y])
	{
		if(dep[top[x]] < dep[top[y]]) swap(x, y);
		x = fa[top[x]];
	}
	return dep[x] < dep[y] ? x : y;
}

int rt, sz[N], mx[N];
bool vis[N];

void getrt(int u, int fa, int all)
{
	sz[u] = 1, mx[u] = 0;
	for(auto v : G[u])
	{
		if(v == fa || vis[v]) continue;
		getrt(v, u, all);
		sz[u] += sz[v];
		mx[u] = max(mx[u], sz[v]);
	}
	mx[u] = max(mx[u], all - sz[u]);
	if(!rt || mx[u] < mx[rt]) rt = u;
	return;
}

int mxd, d[N], cnt[N];
vector<int> nd;

void ins(int u, int fa)
{
	mxd = max(mxd, d[u]), cnt[d[u]]++;
	nd.push_back(u);
	for(auto v : G[u])
		if(v != fa && !vis[v]) d[v] = d[u] + 1, ins(v, u);
	return;
}

void upd(int w)
{
	for(int i = 1; i <= mxd; i++) cnt[i] += cnt[i - 1];
	for(auto x : nd)
	{
		for(auto it : q1[x]) if(it.fi >= d[x])
		{
			if(it.fi - d[x] <= mxd) ans[it.se] += w * cnt[it.fi - d[x]];
			else ans[it.se] += w * cnt[mxd];
		}
	}
	for(int i = 0; i <= mxd; i++) cnt[i] = 0;
	nd.clear();
	return;
}

void solve(int u)
{
	vis[u] = 1;
	mxd = d[u] = 0, ins(u, 0), upd(1);
	for(auto v : G[u]) if(!vis[v])
		mxd = d[v] = 1, ins(v, u), upd(-1);
	for(auto v : G[u]) if(!vis[v])
		rt = 0, getrt(v, u, sz[v]), solve(rt);
	return;
}

void insq(int x, int d, int id)
{
	while(x)
	{
		q3[x].push_back({d, id});
		q2[st[x] - 1].push_back({dep[x] + d, -id});
		q2[ed[x]].push_back({dep[x] + d, id});
		if(fa[top[x]])
		{
			q2[st[top[x]] - 1].push_back({dep[top[x]] + d, id});
			q2[ed[top[x]]].push_back({dep[top[x]] + d, -id});
		}
		x = fa[top[x]];
	}
	return;
}

int c[N];
vector<int> tmp;
void add(int x, int y)
{
	tmp.push_back(++x);
	for(; x <= n + 1; x += x & -x) c[x] += y;
}
int qry(int x)
{
	int res = 0; ++x; 
	for(; x; x -= x & -x) res += c[x];
	return res;
}
void clr()
{
	for(auto x : tmp)
		for(; x <= n + 1; x += x & -x) c[x] = 0;
	tmp.clear();
}

void dfs(int u, int dep)
{
	add(dep, 1);
	if(son[u]) dfs(son[u], dep);
	for(auto v : G[u])
	{
		if(v == fa[u] || v == son[u]) continue;
		dfs(v, dep + 1);
	}
	return;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	
	cin >> n;
	for(int i = 1, u, v; i < n; i++)
		cin >> u >> v, G[u].push_back(v), G[v].push_back(u);
	dfs1(1, 0), dfs2(1, 1);

	cin >> m;
	for(int i = 1; i <= m; i++)
	{
		int x, y, z, d;
		cin >> x >> y >> d; z = LCA(x, y);
		q1[z].push_back({d, i});
		insq(x, d, i), insq(y, d, i);
		insq(z, d, -i), insq(z, d, -i);
	}

	getrt(1, 0, n), solve(rt);

	for(int i = 1; i <= n; i++)
	{
		add(dep[id[i]], 1);
		for(auto p : q2[i])
		{
			if(p.se > 0) ans[p.se] += qry(p.fi);
			else ans[-p.se] -= qry(p.fi);
		}
	}
	clr();

	for(int i = 1; i <= n; i++) if(son[fa[i]] != i)
	{
		for(int x = i; x; x = son[x])
		{
			for(auto p : q3[x])
			{
				if(p.se > 0) ans[p.se] += qry(p.fi);
				else ans[-p.se] -= qry(p.fi);
			}
			add(0, 1);
			for(auto y : G[x])
				if(y != fa[x] && y != son[x]) dfs(y, 1);
		}
		clr();
	}

	for(int i = 1; i <= m; i++) cout << ans[i] << '\n';
	return 0;
}