#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second
#define int ll

void solve() {
    int n; cin >> n;
    vector<vector<pair<int, int>>> g(n);
    int s = 0;
    for (int i = 0; i < n - 1; i++) {
        int u, v, w; cin >> u >> v >> w;
        u--; v--;
        g[u].pb({v, w});
        g[v].pb({u, w});
        s += w;
    }

    vector<vector<int>> dp(n, vector<int>(2));
    // 0 - vertex, 1 - edge
    auto dfs = [&](int v, int p, auto&&self) -> void {
        int s0 = 0;
        vector<int> dlts;
        for (auto &[u, w] : g[v]) {
            if (u != p) {
                self(u, v, self);
                int nd0 = min(dp[u][1], dp[u][0] + w);
                int nd1 = dp[u][0];
                s0 += nd0;
                dlts.pb(nd1 - nd0);
            }
        }
        sort(all(dlts));
        dp[v][0] = min(s0, (dlts.size() < 2 ? s0 : s0 + dlts[0] + dlts[1]));
        dp[v][1] = (dlts.empty() ? 2e9 + 1 : s0 + dlts[0]);
        //cout << v << ' ' << dp[v][0] << ' ' << dp[v][1] << '\n';
    };
    dfs(0, 0, dfs);
    cout << s - dp[0][0] << '\n';
}   

signed main() {
    int tt = 1;
    #ifdef LOCAL 
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else
        ios::sync_with_stdio(false); 
        cin.tie(0); cout.tie(0);
    #endif

    while (tt--) {
        solve();
    }

    return 0;
}