#include <bits/stdc++.h>
#define ll long long 
using namespace std;
const int mx=3e5+5,mk=52,mod=998244353;
int n,u,v,m,k;
int to[mx<<1],head[mx],nxt[mx<<1],cnt=1,dep[mx],anc[mx][mk],Log2[mx];
ll sum[mx][mk];

inline void add_edge(int u,int v){
	to[++cnt]=v;nxt[cnt]=head[u];head[u]=cnt;
}
inline void dfs(int u,int fa){
	dep[u]=dep[fa]+1;anc[u][0]=fa;
	for(int i=1;i<=Log2[n];++i)anc[u][i]=anc[anc[u][i-1]][i-1];
	
	for(ll i=1,now=dep[u];i<=50;++i,(now*=dep[u])%=mod)sum[u][i]=(sum[fa][i]+now)%mod;
	
	for(int i=head[u];i;i=nxt[i]){
		int v=to[i];if(v==fa)continue;
		dfs(v,u);
	}
}
inline int LCA(int x,int y){
	if(dep[x]<dep[y])swap(x,y);
	for(int i=Log2[n];i>=0;--i)
		if(dep[anc[x][i]]>=dep[y])x=anc[x][i];
	if(x==y)return x;
	for(int i=Log2[n];i>=0;--i)
		if(anc[x][i]!=anc[y][i])x=anc[x][i],y=anc[y][i];
	return anc[x][0];
}

inline int query(int u,int v,int k){
	int lca=LCA(u,v);
	ll ret=(sum[u][k]+sum[v][k]-sum[lca][k]+mod-sum[anc[lca][0]][k]+mod)%mod;
	//printf("  u=%d,v=%d,lca=%d\n",u,v,lca);
	return (int)ret;
}

int main()
{
	scanf("%d",&n);
	for(int i=2;i<=n;++i)Log2[i]=Log2[i/2]+1;
	for(int i=1;i<n;++i)scanf("%d%d",&u,&v),add_edge(u,v),add_edge(v,u);
	dep[0]=-1;dfs(1,0);
	scanf("%d",&m);
	while(m--)scanf("%d%d%d",&u,&v,&k),printf("%d\n",query(u,v,k));
	return 0;
}