#include<bits/stdc++.h>
using namespace std;

#define rep(i,n) for(ll i=0;i<(n);++i)
using ll = long long;
using pll = pair<ll,ll>;
constexpr ll INF = (1LL<<60);
constexpr ll MOD = (1e9+7);
//constexpr ll MOD = (998244353);
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}return 0;}
void dump(){cout<<endl;}
template<class T,class... Ts> void dump(T&& h, Ts&&... t){cout<<h<<", ";dump(forward<Ts>(t)...);}
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T>vector<T> make_vector(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto make_vector(size_t a, Ts... ts){return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));}

void solve1();void solve2();
int main(){
  solve1();
  return 0;
}
using vertex = struct vertex{ll to,cost;vertex(ll to,ll cost):to(to),cost(cost){}};
using edge = struct edge{ll from,to,cost;edge(){}edge(ll from,ll to,ll cost):from(from),to(to),cost(cost){}};
using weighted_adjlist = vector<vector<vertex>>;
using weighted_edge = vector<edge>;

void solve1(){

  ll n;
  cin>>n;
  weighted_adjlist adj(n);
  weighted_edge edges(n-1);
  vector<ll> deg(n);
  rep(i,n-1){
    ll u,v,w;
    cin>>u>>v>>w;
    u--;v--;
    adj[u].emplace_back(v,w);
    adj[v].emplace_back(u,w);
    edges[i]=edge(u,v,w);
    deg[u]++;
    deg[v]++;
  }

  vector<ll> dist(n);
  queue<ll> que;
  rep(i,n){
    if(deg[i]==1){
      que.emplace(i);
    }
  }

  while(!que.empty()){
    ll now = que.front();
    que.pop();
    dist[now]++;
    for(auto nxt:adj[now]){
      if(deg[nxt.to]!=1)dist[nxt.to]+=dist[now];
      deg[nxt.to]--;
      if(deg[nxt.to]==1)que.emplace(nxt.to);
    }
  }

  ll ans = 0;
  for(auto e:edges){
    ll a = min(dist[e.from],dist[e.to]);
    ll b = n-a;
    ans += e.cost*a*b*2;
  }
  cout<<(ans)<<endl;

}