#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 3e5;
const int K = 50;
const long long mod = 998244353LL;
int n,m;
int to[(N << 1) + 10],pre[(N << 1) + 10],first[N + 10],edge_tot;
inline void read(int &x)
{
    x = 0;
    char ch = 0,w = 0;
    while(ch < '0' || ch > '9')
        w |= ch == '-',ch = getchar();
    while(ch >= '0' && ch <= '9')
        x = (x << 3) + (x << 1) + (ch ^ '0'),ch = getchar();
    w ? x = -x : NULL;
}
inline void add(int u,int v)
{
    to[++edge_tot] = v;
    pre[edge_tot] = first[u];
    first[u] = edge_tot;
}
int f[N + 10],d[N + 10],sz[N + 10],son[N + 10],top[N + 10];
long long pw[N + 10][K + 10];
void dfs1(int p,int fa,int dep)
{
    long long temp = dep;
    f[p] = fa;
    d[p] = dep;
    sz[p] = 1;
    for(register int i = 1;i <= K;++i)
        pw[p][i] = pw[fa][i] + temp,temp = temp * dep % mod;
    for(register int i = first[p];i;i = pre[i])
        if(to[i] ^ fa)
        {
            dfs1(to[i],p,dep + 1);
            sz[p] += sz[to[i]];
            if(!son[p] || sz[son[p]] < sz[to[i]])
                son[p] = to[i];
        }
}
void dfs2(int p,int t)
{
    top[p] = t;
    if(!son[p])
        return ;
    dfs2(son[p],t);
    for(register int i = first[p];i;i = pre[i])
        if(!top[to[i]])
            dfs2(to[i],to[i]);
}
int getlca(int x,int y)
{
    while(top[x] ^ top[y])
        if(d[top[x]] > d[top[y]])
            x = f[top[x]];
        else
            y = f[top[y]];
    return d[x] < d[y] ? x : y;
}
int main()
{
    read(n);
    int u,v;
    for(register int i = 1;i < n;++i)
        read(u),read(v),add(u,v),add(v,u);
    dfs1(1,0,0);
    dfs2(1,1);
    int x,y,k,lca;
    read(m);
    while(m--)
    {
        read(x),read(y),read(k);
        lca = getlca(x,y);
        printf("%lld\n",(pw[x][k] + pw[y][k] - pw[lca][k] - pw[f[lca]][k]) % mod);
    }
}