#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 998244353;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////
vector<vector<edge>> g;

void dfs(ll u, ll v, vector<ll>& subtr) {
	for (edge e : g[v]) {
		ll w = e.to;
		if (u == w) { continue; }
		dfs(v, w, subtr);
		subtr[v] += subtr[w];
	}
	subtr[v]++;
}

ll calc(ll u, ll v, const vector<ll>& subtrc) {
	ll ret = 0;
	for (edge e : g[v]) {
		ll w = e.to;
		if (u == w) { continue; }
		ret += calc(v, w, subtrc) + e.d * subtrc[w]*2;
	}

	return ret;
}

int main() {
	ll N;
	cin >> N;
	g.resize(N + 1);

	repn(i, N - 1) {
		ll a, b, c;
		cin >> a >> b >> c;
		g[a].push_back({ i,a,b,c });
		g[b].push_back({ i,b,a,c });
	}

	vector<ll> subtr(N + 1, 0);
	dfs(0, 1, subtr);

	//repn(i, N) cout << subtr[i] << endl;

	ll u = 0;
	ll c = 1;
	while (1) {
		ll nxt = 0;
		for (edge e : g[c]) {
			ll v = e.to;
			if (u == v) { continue; }
			if (subtr[v] > N / 2) { nxt = v; }
		}

		if (nxt == 0) { break; }
		u = c;
		c = nxt;
	}

	//cout << c << endl;

	vector<ll> subtrc(N + 1, 0);
	dfs(0, c, subtrc);

	//repn(i, N) cout << subtrc[i] << endl;

	ll ans = calc(0, c, subtrc);

	ll minus = INF;
	for (edge e : g[c]) {
		if (subtrc[e.to] * 2 == N) { minus = e.d; break; }
		minus = min(minus, e.d);
	}

	ans -= minus;
	cout << ans << endl;
	
}

Measured memory_bytes: 19456