/* ---------- STL Libraries ---------- */

// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>

// container library
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

/* ---------- Namespace ---------- */

using namespace std;

/* ---------- Type Abbreviation ---------- */

template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;

using ll = long long;

#define fst first
#define snd second
#define mp make_pair
#define mt make_tuple

/* ---------- conversion ---------- */

#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)
#define DOUBLE(n) static_cast<double>(n)

/* ---------- container ---------- */

#define ALL(v) (v).begin(), (v).end()
#define SIZE(v) (LL((v).size()))

#define FIND(v, k) (v).find(k) != (v).end()
#define VFIND(v, k) find(ALL(v), k) != (v).end()

#define gsort(b, e) sort(b, e, greater<decltype(*b)>())

/* ----------- debug ---------- */

template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
    os << "[";
    for (auto vv : v)
        os << vv << ",";
    return os << "]";
}

template <class T>
ostream& operator<<(ostream& os, set<T> v) {
    os << "[";
    for (auto vv : v)
        os << vv << ",";
    return os << "]";
}

template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
    return os << "(" << p.fst << "," << p.snd << ")";
}

/* ---------- Constants ---------- */

// const ll MOD = 1e9 + 7;
// const int INF = 1 << 25;
const ll INF = 1LL << 50;
// const double PI = acos(-1);
// const double EPS = 1e-10;
// mt19937 mert(LL(time(0)));

/* ---------- Short Functions ---------- */

template <typename T>
T sq(T a) {
    return a * a;
}

template <typename T>
T gcd(T a, T b) {
    if (a > b) return gcd(b, a);
    return a == 0 ? b : gcd(b % a, a);
}

template <typename T, typename U>
T mypow(T b, U n) {
    if (n == 0) return 1;
    if (n == 1) return b /* % MOD */;
    if (n % 2 == 0) {
        return mypow(b * b /* % MOD */, n / 2);
    } else {
        return mypow(b, n - 1) * b /* % MOD */;
    }
}

ll pcnt(ll b) {
    return __builtin_popcountll(b);
}

/* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */

ll N;
vector<pair<ll, ll>> path[100010];
ll chsize[100010];
vector<ll> center;

ll chdfs(ll v) {
    chsize[v] = 1;
    bool judge = true;

    for (auto p : path[v]) {
        ll sv = p.first;
        if (chsize[sv] < 0) {
            chsize[v] += chdfs(sv);
            if (chsize[sv] > N / 2) judge = false;
        }
    }

    if (N - chsize[v] > N / 2) judge = false;
    if (judge) center.push_back(v);

    return chsize[v];
}

int main() {
    cin >> N;

    for (ll i = 0; i < N - 1; ++i) {
        ll A, B, C;
        cin >> A >> B >> C;
        --A, --B;
        path[A].push_back(mp(B, C));
        path[B].push_back(mp(A, C));
    }

    fill(chsize, chsize + N, -1);
    chdfs(0);

    fill(chsize, chsize + N, -1);
    ll ans = 0;

    ll r = center[0], sr, pat = center.size();
    if (pat == 2) sr = center[1];
    chdfs(r);

    ll cut = INF;

    for (ll v = 0; v < N; ++v) {
        for (auto p : path[v]) {
            ll sv, c;
            tie(sv, c) = p;
            ans += min(chsize[v], chsize[sv]) * c;

            if (pat == 1 && v == r) {
                cut = min(cut, c);
            } else if (pat == 2 && v == r && sv == sr) {
                cut = min(cut, c);
            }
        }
    }

    ans -= cut;
    cout << ans << endl;

    return 0;
}


Measured memory_bytes: 13952