#include<bits/stdc++.h>

using namespace std;

#define MAXK 55

#define MAXN 300010

#define MAXLOG 20

const long long P = ;

struct Edge

{

        int to,nxt;

} e[MAXN<<];

int n,x,i,j,y,q,k,Lca,tot;

int anc[MAXN][MAXLOG],dep[MAXN],head[MAXN],fa[MAXN];

long long p[MAXN][MAXK],s[MAXN][MAXK];

long long ans;

template <typename T> inline void read(T &x)

{

    int f = ; x = ;

    char c = getchar();

    for (; !isdigit(c); c = getchar()) { if (c == '-') f = -f; }

    for (; isdigit(c); c = getchar()) x = (x << ) + (x << ) + c - '';

    x *= f;

}

template <typename T> inline void write(T x)

{

    if (x < )

    {

        putchar('-');

        x = -x;

    }

    if (x > ) write(x/);

    putchar(x%+'');

}

template <typename T> inline void writeln(T x)

{

    write(x);

    puts("");

}

inline void add(int x,int y)

{

        tot++;

        e[tot] = (Edge){y,head[x]};

        head[x] = tot;

}

inline void dfs(int u)

{

        int i,v;

        anc[u][] = fa[u];

        for (i = ; i < MAXLOG; i++)

        {

                if (dep[u] < ( << i)) break;

                anc[u][i] = anc[anc[u][i-]][i-];

        }

        for (i = head[u]; i; i = e[i].nxt)

        {

                v = e[i].to;

                if (fa[u] != v)

                {

                        fa[v] = u;

                        dep[v] = dep[u] + ;

                        dfs(v);

                }

        }

}

inline int lca(int x,int y)

{

        int i,t;

        if (dep[x] > dep[y]) swap(x,y);

        t = dep[y] - dep[x];

        for (i = ; i < MAXLOG; i++)

        {

                if (t & ( << i))

                        y = anc[y][i];

        }

        if (x == y) return x;

        for (i = MAXLOG - ; i >= ; i--)

        {

                if (anc[x][i] != anc[y][i])

                {

                        x = anc[x][i];

                        y = anc[y][i];

                }

        }

        return fa[x];

}

int main()

{

        read(n);

        for (i = ; i < n; i++)

        {

                read(x); read(y);

                add(x,y);

                add(y,x);

        }

        for (i = ; i < n; i++)

        {

                p[i][] = ;

                for (j = ; j < MAXK; j++) p[i][j] = p[i][j-] * i % P;

        }

        for (i = ; i < n; i++)

        {

                for (j = ; j < MAXK; j++)

                {

                        s[i][j] = (s[i-][j] + p[i][j]) % P;

                }

        }

        dfs();

        read(q);

        while (q--)

        {

                read(x); read(y); read(k);

                Lca = lca(x,y);

                ans = (s[dep[x]][k] + s[dep[y]][k]) % P;

                ans = ((ans - ( * s[dep[Lca]][k]) % P) + P) % P;

                ans = (ans + p[dep[Lca]][k] + P) % P;

                writeln(ans);

        }

        return ;

}