#include <iostream>

#include <cstdio>

#include <cmath>

#include <cstring>

#include <string>

using namespace std;

const int N = 1e5 + ;

#define oo 999999999999

#define yxy getchar()

int n, now, Point, Min_siz;

int head[N] ,siz[N], Que[N << ];

struct Node {int v, w, nxt;} G[N << ];

bool vis[N];

long long dis[N];

inline int read(){

    int x = ; char c = yxy;

    while(c < '' || c > '') c = yxy;

    while(c >= '' && c <= '') x = x *  + c - '', c = yxy;

    return x;

}

inline void add(int u, int v, int w){

    G[now].v = v; G[now].w = w; G[now].nxt = head[u]; head[u] = now ++;

}

void dfs(int u, int father){

    siz[u] = ;

    int Max_son = -;

    for(int i = head[u]; ~ i; i = G[i].nxt){

        int v = G[i].v;

        if(v != father){

            dfs(v, u);

            siz[u] += siz[v];

            Max_son = max(Max_son, siz[v]);

        }

    }

    Max_son = max(Max_son, n - siz[u]);

    if(Max_son < Min_siz){

        Min_siz = Max_son;

        Point = u;

    }

}

void spfa(int S){

    for(int i = ; i <= n; i ++) dis[i] = oo;

    dis[S] = ;

    int H = , T = ;

    Que[H] = S;

    while(H <= T){

        int topp = Que[H ++];

        vis[topp] = ;

        for(int i = head[topp]; ~ i; i = G[i].nxt){

            int v = G[i].v;

            if(dis[v] > dis[topp] + G[i].w){

                dis[v] = dis[topp] + G[i].w;

                if(!vis[v]) vis[v] = , Que[++ T] = v;

            }

        }

    }

}

int main()

{

    n = read();

    for(int i = ; i <= n; i ++) head[i] = -;

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

        int u = read(), v = read(), w = read();

        add(u, v, w); add(v, u, w);

    }

    Min_siz = ;

    dfs(, );

    spfa(Point);

    long long Answer = ;

    for(int i = ; i <= n; i ++) Answer += dis[i];

    cout << Answer;

    return ;

}