#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define Cint boost::multiprecision::cpp_int
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
bool dbg = true;
}  // namespace mydef
using namespace mydef;
#define pb push_back
//#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define asn ans
template <typename sum_t, typename key_t>
struct ReRooting {
    struct Edge {
        int to;
        key_t data;
        sum_t dp, ndp;
    };

    using F = function<sum_t(sum_t, sum_t)>;
    using G = function<sum_t(sum_t, key_t)>;

    vector<vector<Edge>> g;
    vector<sum_t> subdp, dp;
    const sum_t ident;
    const F f;
    const G gg;

    ReRooting(int V, const F f, const G g, const sum_t& ident)
        : g(V), f(f), gg(g), ident(ident), subdp(V, ident), dp(V, ident) {}

    void add_edge(int u, int v, const key_t& d) {
        g[u].emplace_back((Edge){v, d, ident, ident});
        g[v].emplace_back((Edge){u, d, ident, ident});
    }

    void add_edge_bi(int u, int v, const key_t& d, const key_t& e) {
        g[u].emplace_back((Edge){v, d, ident, ident});
        g[v].emplace_back((Edge){u, e, ident, ident});
    }

    void dfs_sub(int idx, int par) {
        for (auto& e : g[idx]) {
            if (e.to == par)
                continue;
            dfs_sub(e.to, idx);
            subdp[idx] = f(subdp[idx], gg(subdp[e.to], e.data));
        }
    }

    void dfs_all(int idx, int par, const sum_t& top) {
        sum_t buff{ident};
        for (int i = 0; i < (int)g[idx].size(); i++) {
            auto& e = g[idx][i];
            e.ndp = buff;
            e.dp = gg(par == e.to ? top : subdp[e.to], e.data);
            buff = f(buff, e.dp);
        }
        dp[idx] = buff;
        buff = ident;
        for (int i = (int)g[idx].size() - 1; i >= 0; i--) {
            auto& e = g[idx][i];
            if (e.to != par)
                dfs_all(e.to, idx, f(e.ndp, buff));
            e.ndp = f(e.ndp, buff);
            buff = f(buff, e.dp);
        }
    }

    vector<sum_t> build() {
        dfs_sub(0, -1);
        dfs_all(0, -1, ident);
        return dp;
    }
};
//https://ei1333.hateblo.jp/entry/2018/12/21/004022


int N, A[201010], B[201010], C[201010];
const int geta = 201010;
vp memo;

void solve() {
    memo.resize(N - 1);
    ReRooting<int, int> G(
        N,
        [](int a, int b) { return a + b; },
        [&](int a, int b) {
            if (b >= geta) {
                b -= geta;
                memo[b].second = a + 1;
            } else {
                memo[b].first = a + 1;
            }
            return a + 1;
        },
        0ll);

    for (int i = 0; i < N - 1; i++) {
        G.add_edge_bi(A[i], B[i], i, i + geta);
    }
    G.build();

    Cint ans = 0;

    int id = -1;
    int MIN_cnt = INF;
    for (int i = 0; i < N - 1; i++) {
        auto p = memo[i];
        chmin(MIN_cnt, abs(p.first - p.second));
    }
    for (int i = 0; i < N - 1; i++) {
        auto p = memo[i];
        if (MIN_cnt == abs(p.first - p.second)) {
            if (p.first - p.second == MIN_cnt)
                id = B[i];
            else
                id = A[i];
        }
    }
    dump(id);
    dump(MIN_cnt);
    int MIN = INF;
    for (int i = 0; i < N - 1; i++) {
        auto p = memo[i];
        ans += (Cint)1 * C[i] * min(p.first, p.second) * 2;
        if (MIN_cnt > 0) {
            if (A[i] == id || B[i] == id) {
                chmin(MIN, C[i]);
            }
        } else {
            if (p.first == p.second)
                MIN = C[i];
        }
        /*
            if (S.count(i)) {
                chmin(MIN, C[i]);
            }
            */
    }
    ans -= MIN;
    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> N;
    for (int i = 0; i < N - 1; i++) {
        cin >> A[i] >> B[i] >> C[i];
        A[i]--;
        B[i]--;
    }

    solve();
    return 0;
}


Measured memory_bytes: 36492