#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<vector<int>>> dp(n, vector<vector<int>>(2, vector<int>(2, 2e9 + 1)));
    // 0 - vertex, 1 - edge
    auto dfs = [&](int v, int p, auto&&self) -> void {
        int s00 = 0, md00 = 2e9 + 1;
        vector<int> ds2;
        vector<int> dsf01, sons;
        int S = 0;
        for (auto &[u, w] : g[v]) {
            if (u != p) {
                S++;
                self(u, v, self);
                sons.pb(u);
                int nd00 = min(dp[u][1][0], w + min(dp[u][0][0], dp[u][0][1]));
                s00 += nd00;
                int nd01 = dp[u][1][1];
                md00 = min(md00, nd01 - nd00);
                ds2.pb(nd01 - nd00);
                int nd10 = dp[u][0][0];
                dsf01.pb(nd10 - nd00);
                //if (v == 0) cout << u + 1 << ' ' << nd10 << ' ' << nd00 << '\n';
            }
        }
        dp[v][0][0] = s00; // = sum by all sons dpnew[u][0][0]
        dp[v][0][1] = s00 + md00; // one can be dpnew[u][0][1]
        vector<int> ordd(S);
        iota(all(ordd), 0);
        sort(all(ordd), [&](int s1, int s2) {
            return dsf01[s1] < dsf01[s2];
        });
        // if (v == 0) {
        //     cout << "-------\n";
        //     for (auto &u : sons) cout << u << ' ';
        //     cout << '\n';
        //     for (auto &u : dsf01) cout << u << ' ';
        //     cout << '\n';
        //     for (auto &u : ordd) cout << u << ' ';
        //     cout << '\n';
        //     cout << "-------\n";
        // }
        if (dsf01.size() >= 2) {
            dp[v][0][1] = min(dp[v][0][1], s00 + dsf01[ordd[0]] + dsf01[ordd[1]]);
            for (auto [son, w] : g[v]) {
                if (son == p) continue;
                int val = dp[son][0][1];
                int v2 = val + s00 - min(dp[son][1][0], w + min(dp[son][0][0], dp[son][0][1]));
                //if (v == 0) cout << "fuck1 " << v2 << '\n';
                if (sons[ordd[0]] == son) {
                    v2 += dsf01[ordd[1]];
                    //if (v == 0) cout << "fuckkxd " << ordd[1] << " ff " << sons[ordd[1]] << '\n';
                } else {
                    //if (v == 0) cout << "fuckkxd " << sons[ordd[0]] << '\n';
                    v2 += dsf01[ordd[0]];
                }
                //if (v == 0) cout << son + 1 << ' ' << v2 << "fuck\n";
                dp[v][0][1] = min(dp[v][0][1], v2);
            }
        }
        dp[v][1][0] = (dsf01.size() == 0 ? 2e9 + 1 : s00 + dsf01[ordd[0]]);
        vector<int> order(sz(sons));
        iota(all(order), 0);
        sort(all(order), [&](int s1, int s2) {
            return ds2[s1] < ds2[s2];
        });
        if (S == 1) {
            for (auto &[u, w] : g[v]) {
                if (u != p) {
                    dp[v][1][1] = dp[u][0][1];
                }
            }
        }   
        else {
            for (auto &[u, w] : g[v]) {
                if (u != p) {
                    dp[v][1][1] = min(dp[v][1][1], dp[u][0][1] + s00 - min(dp[u][1][0], w + min(dp[u][0][0], dp[u][0][1])));
                    //dp[v][1][1] = min(dp[v][1][1], dp[u][0][0] + s00 - min(dp[u][1][0], w + min(dp[u][0][0], dp[u][0][1])) + 
                                        //(sons[order[0]] == u ? ds2[order[1]] : ds2[order[0]]));
                    //if (v == 1) cout << u << ' ' << dp[v][1][1] << '\n';
                }
            }
        }
        //cout << v + 1 << ' ' << dp[v][0][0] << ' ' << dp[v][0][1] << ' ' << dp[v][1][0] << ' ' << dp[v][1][1] << '\n';
    };
    dfs(0, 0, dfs);
    cout << s - min(dp[0][0][0], dp[0][0][1]) << '\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;
}