#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

const ll INF = 1'000'000'000'000'000'000;

void solve() {
    int n; cin >> n;
    vector<vector<pair<int, int>>> g(n);
    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});
    }    
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        vector<array<ll, 2>> dp(n);
        auto dfs = [&](int v, ll inc_w, int p, auto&&self) -> void {
            dp[v][1] = inc_w;
            ll bb = -INF, sm = 0;
            for (auto [u, w] : g[v]) {
                if (u != p) {
                    self(u, w, v, self);
                    bb = max(bb, dp[u][1] - dp[u][0]);
                    sm += dp[u][0];
                }
            }
            dp[v][1] += sm;
            dp[v][0] = max(dp[v][0], max(sm, bb + inc_w + sm));
        };
        dfs(i, -INF, i, dfs);
        ans = max(ans, dp[i][0]);
    }
    cout << ans << '\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;
}