#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAXN = 100005;

int n, sum, dp[MAXN][3], ans;
vector< pair<int, int> > tree[MAXN];
pair<int, int> a[MAXN]; int tot;

inline void cmax(int &x, int y) {
    if (x < y) x = y;
}

void DFS(int u, int fa) {
    for (auto [v, w] : tree[u]) {
        if (v == fa) continue;
        DFS(v, u);
        cmax(dp[u][0], dp[v][0] + w);
        cmax(dp[u][1], dp[v][1]);
        cmax(dp[u][2], dp[v][2] + w);
    }
    tot = 0;
    for (auto [v, w] : tree[u]) {
        if (v == fa) continue;
        a[++tot] = make_pair(dp[v][0] + w, v);
    }
    sort(a + 1, a + tot + 1);
    reverse(a + 1, a + tot + 1);
    for (auto [v, w] : tree[u]) {
        if (v == fa) continue;
        if (tot >= 2) {
            cmax(ans, dp[v][2] + w + (a[1].second == v? a[2].first : a[1].first));
            cmax(dp[u][2], dp[v][1] + (a[1].second == v? a[2].first : a[1].first));
        }
        if (tot >= 3) {
            int sum = a[1].first + a[2].first;
            if (a[1].second == v) {
                sum += a[3].first - a[1].first;
            } else if (a[2].second == v) {
                sum += a[3].first - a[2].first;
            }
            cmax(ans, dp[v][1] + sum);
        }
    }
    if (tot >= 2) {
        cmax(dp[u][1], a[1].first + a[2].first);
    }
    if (tot >= 3) {
        cmax(dp[u][2], a[1].first + a[2].first + a[3].first);
    }
    if (tot >= 4) {
        cmax(ans, a[1].first + a[2].first + a[3].first + a[4].first);
    }
}

void solve() {
    scanf("%d", &n);
    for (int i = 1, u, v, w; i < n; ++i) {
        scanf("%d %d %d", &u, &v, &w);
        sum += w;
        tree[u].push_back(make_pair(v, w));
        tree[v].push_back(make_pair(u, w));
    }
    DFS(1, 0);
    cmax(ans, dp[1][0]);
    cmax(ans, dp[1][1]);
    cmax(ans, dp[1][2]);
    printf("%d\n", sum * 2 - ans);
}

int main() {
    solve();
    return 0;
}