#include<cstdio>
#include<cstring>
#define ll long long 
using namespace std;
const int N=100010;
struct node
{
    int next,to,p;
}e[N*2];
int first[N],book[N],size[N];
int cnt=0;
ll sum=0;
int n;

void insert(int v,int u,int p)
{
    e[++cnt].to=v;e[cnt].next=first[u];first[u]=cnt;e[cnt].p=p;
    e[++cnt].to=u;e[cnt].next=first[v];first[v]=cnt;e[cnt].p=p;
}

void dfs1(int x)
{
    book[x]=1;size[x]=1;
    for(int i=first[x];i;i=e[i].next)
    {
        if(book[e[i].to]==0)
        {
            dfs1(e[i].to);
            size[x]+=size[e[i].to];
        }
    }
}

void dfs(int x)
{
    book[x]=1;
    for(int i=first[x];i;i=e[i].next)
    {
        if(book[e[i].to]==0)
        {
            sum+=(ll)e[i].p*size[e[i].to]*(n-size[e[i].to]);
            dfs(e[i].to);
        }
    }
}

int main()
{
    freopen("A.in","r",stdin);
    freopen("A.out","w",stdout);
    scanf("%d",&n);
    int v,u,p;
    for(int i=1;i<=n-1;i++)
    {
        scanf("%d %d %d",&u,&v,&p);
        insert(u,v,p);
    }
    memset(book,0,sizeof(book));
    dfs1(1);
    memset(book,0,sizeof(book));
    dfs(1);
    printf("%lld\n",sum);
}