#include<iostream>

 #include<cstdio>

 #include<vector>

 using namespace std;

 #define LL long long

 const int MOD = 1e9+;

 const int N = 1e5+;

 struct EDGE {

     LL to, length;

 };

 vector<EDGE> edge[N];

 LL n, factorial[N], lchild[N], w[N];

 int dfs(int k, int pre) {

     int size = edge[k].size(), ans=;

     for(int i=; i<size; i++) {

         if(edge[k][i].to == pre)

             w[k] = edge[k][i].length;

         else

             ans += dfs(edge[k][i].to, k);

     }

     return lchild[k] = ans;

 }

 int main()

 {

     factorial[] = ;

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

         factorial[i] = factorial[i-]*i%MOD;

     while(~scanf("%d",&n))

     {

         LL  ans=;

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

             edge[i].clear();

         }

         for(int x,y,v,i=; i<n; i++) {

             scanf("%d%d%d", &x, &y, &v);

             edge[x].push_back({y,v});

             edge[y].push_back({x,v});

         }

         dfs(, -);

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

             LL tmp=;

             tmp = lchild[i]*(n-lchild[i])%MOD;

             tmp = *factorial[n-]%MOD*w[i]%MOD*tmp%MOD;

             ans = (ans+tmp)%MOD;

         }

         cout<<ans<<endl;

     }

     return ;

 }