#include <bits/stdc++.h>

using namespace std;

#define int long long

const int maxn = ;

const int mod = 1e9+;

typedef long long ll;

typedef pair<int, int> P;

vector<P> G[maxn];

ll fact[maxn], ans;

int n, child[maxn];

void dfs(int u, int fa)///记录下父节点，避免重复遍历父节点

{

//    printf("%d->%d\n", fa, u);

    child[u] = ;

    int len = G[u].size();

    for(int i=;i<len;i++)

    {

        int v = G[u][i].first;

        if(v!=fa)

        {

            dfs(v, u);

            child[u] += child[v];

            ans += child[v]*(n-child[v])*G[u][i].second % mod;

            ans %= mod;

        }

    }

}

signed main()

{

    fact[] = ;

    for(int i=;i<maxn;i++)

    {

        fact[i] = fact[i-] * i % mod;

//        printf("%d %lld\n", i, fact[i]);

    }

    int u, v, d;

    while(scanf("%d", &n)!=EOF)

    {

        memset(child, , sizeof(child));

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

        {

            scanf("%d %d %d", &u, &v, &d);

            G[u].push_back(P(v, d));

            G[v].push_back(P(u, d));

        }

        ans = ;

        dfs(, -);

        printf("%lld\n", *ans*fact[n-]%mod);

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

            G[i].clear();

    }

    return ;

}