#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(4) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

const int N = 1e5 + 10;

struct edge {
    int from, to, w;
};

vector<edge> e;
vi g[N];

int cnt[N];

void cnt_dfs(int v, int par) {
    cnt[v] = 1;
    for (int id : g[v]) {
        int to = e[id].to;
        if (to == par)
            continue;
        cnt_dfs(to, v);
        cnt[v] += cnt[to];
    }
}

int sec = -1;

int find_centroid(int v, int par, int sz) {
    for (int id : g[v]) {
        int to = e[id].to;
        if (to == par)
            continue;
        if (cnt[to] * 2 > sz)
            return find_centroid(to, v, sz);
        if (cnt[to] * 2 == sz) {
            sec = to;
        }
    }
    return v;
}


ll ans = 0;

void dfs(int v, int par, ll cw) {
    ans += cw * 2;
    for (int id : g[v]) {
        int to = e[id].to;
        if (to == par)
            continue;
        dfs(to, v, cw + e[id].w);
    }
}

void smain() {
    int n;
    cin >> n;
    fori (i, n - 1) {
        int u, v, w;
        cin >> u >> v >> w;
        g[u].push_back(e.size());
        e.push_back({u, v, w});
        g[v].push_back(e.size());
        e.push_back({v, u, w});
    }
    cnt_dfs(1, -1);
    int v = find_centroid(1, -1, cnt[1]);

    dfs(v, sec, 0);
    if (sec != -1)
        dfs(sec, v, 0);
    if (sec == -1) {
        ll mn = ans;
        for (int id : g[v]) {
            inmin(mn, (ll) e[id].w);
        }
        ans -= mn;
    } else {
        int ed = -1;
        for (int id : g[v]) {
            int to = e[id].to;
            if (to == sec) {
                ed = e[id].w;
            }
        }
        ans += (n - 1) * ed;
    }
    cout << ans;
}

Measured memory_bytes: 16428