#include<bits/stdc++.h>
using namespace std;

using i64 = long long;
using u64 = unsigned long long;

struct debug {
#define contPrint { *this << "["; \
        int f = 0; for(auto it : x) { *this << (f?", ":""); *this << it; f = 1;} \
        *this << "]"; return *this;}
 
    ~debug(){cerr << endl;}
    template<class c> debug& operator<<(c x) {cerr << x; return *this;}
    template<class c, class d>
    debug& operator<<(pair<c, d> x) {*this << "(" << x.first << ", " << x.second << ")"; 
        return *this;}
    template<class c> debug& operator<<(vector<c> x) contPrint;
#undef contPrint
};

#define dbg(x) "[" << #x << ": " << x << "]  "
#define Wa() cerr << "[LINE: " << __LINE__ << "] -> "; debug() << 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);

const int N = 1e5 + 5;
vector<pair<int, int>> G[N];
vector<array<int, 3>> W[N];

int dfs1(int cur, int p)
{
    W[cur].push_back({0, 0});
    W[cur].push_back({0, 0});
    W[cur].push_back({0, 0});
    W[cur].push_back({0, 0});

    for(auto it : G[cur]) {
        if(it.first != p) {
            int w = dfs1(it.first, cur) + it.second;
            W[cur].push_back({w, it.first, it.second});
        }
    }
    sort(W[cur].rbegin(), W[cur].rend());
    if(W[cur].size()) return (*W[cur].begin())[0];
    return 0;
}

int ans = 0;

void dfs2(int cur, int one, int two)
{
    for(auto [w, to, to_w] : W[cur]) {
        if(to != 0) {
            int next_one = one;
            auto it = W[cur].begin();
            if((*it)[1] == to) {
                it++;
                next_one = max(next_one, (*it)[0]);
            } else {
                next_one = max(next_one, (*it)[0]);
            }

            int next_two = two;
            it = W[cur].begin();
            if((*it)[1] == to) {
                ++it;
                next_two = max(next_two, one + (*it)[0]);
            } else {
                next_two = max(next_two, one + (*it)[0]);
            }

            int sum = 0;
            int c = 0;
            it = W[cur].begin();
            while(c < 2) {
                if((*it)[1] != to) {
                    sum += (*it)[0];
                    c++;
                }
                it++;
            }

            next_two = max(next_two, sum);

            dfs2(to, next_one + to_w, next_two);
        }
    }

    auto it = W[cur].begin();
    int sum = (*it)[0];
    it++;
    sum += (*it)[0];

    ans = max({ans, sum + two, sum + one});

    it++;
    sum += (*it)[0];
    ans = max(ans, sum + one);

    it++;
    sum += (*it)[0];
    ans = max(ans, sum);

    // Wa() dbg(cur) dbg(sum) dbg(one) dbg(two);
}

int main() 
{
    int tot = 0;
    int n;
    scanf("%d", &n);
    for(int i = 1; i < n; i++) {
        int u, v, w;
        scanf("%d %d %d", &u, &v, &w);
        G[u].push_back({v, w});
        G[v].push_back({u, w});
        tot += 2 * w;
    }
    dfs1(1, 1);
    dfs2(1, 0, 0);
    printf("%d\n", tot - ans);
}