#include <iostream>#include <algorithm>#include <stdio.h>#include <cmath>#include <string.h>using namespace std;#define maxn 200010#define LL long longstruct Eg{ int a,b,w; bool operator<(const Eg &t)const{ return w>t.w; }}E[maxn<<1];int f[maxn];LL cnt[maxn],sum[maxn];int Find(int x){ if(x!=f[x]) f[x]=Find(f[x]); return f[x];}int main(){ int n; int i; while(scanf("%d",&n)!=EOF){ for(i=0;i<n-1;i++) scanf("%d %d %d",&E[i].a,&E[i].b,&E[i].w); sort(E,E+n-1); for(i=1;i<=n;i++){ f[i]=i; cnt[i]=1; sum[i]=0; } LL ans=0; int u,v; LL su,sv; for(i=0;i<n-1;i++){ u=Find(E[i].a); v=Find(E[i].b); su=cnt[v]*E[i].w+sum[u]; sv=cnt[u]*E[i].w+sum[v]; if(su>sv){ f[v]=u; cnt[u]+=cnt[v]; sum[u]=su; }else { f[u]=v; cnt[v]+=cnt[u]; sum[v]=sv; } ans=max(ans,max(su,sv)); } printf("%lldn",ans); } return 0;}
