#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <algorithm>

#include <utility>

#define Mod 1000000007

using namespace std;

#define N 200010

int fa[N];

ll cap[N];

int num[N];

ll ans;

void makeset(int n)

{

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

    {

        fa[i] = i;

        num[i] = ;

        cap[i] = ;

    }

}

int findset(int x)

{

    if(x != fa[x])

    {

        fa[x] = findset(fa[x]);

    }

    return fa[x];

}

void unionset(int a,int b,int c)

{

    int x = findset(a);

    int y = findset(b);

    if(x == y)

        return;

    ll ca = (ll)num[y]*c + cap[x];  //一定要手动转化成long long

    ll cb = (ll)num[x]*c + cap[y];

    if(ca >= cb)

    {

        fa[y] = x;

        num[x] += num[y];

        cap[x] = ca;

    }

    else

    {

        fa[x] = y;

        num[y] += num[x];

        cap[y] = cb;

    }

    ans = max(ans,max(ca,cb));

}

struct node

{

    int u,v,w;

}se[N];

int cmp(node a,node b)

{

    return a.w>b.w;

}

int main()

{

    int n,i;

    int a,b,c;

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

    {

        makeset(n);

        ans = -Mod;

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

        {

            scanf("%d%d%d",&se[i].u,&se[i].v,&se[i].w);

        }

        sort(se,se+n-,cmp);

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

            unionset(se[i].u,se[i].v,se[i].w);

        cout<<ans<<endl;

    }

    return ;

}