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

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()

using edge = pair<int, ll>;
vector<edge> g[100010];
int N;
ll ret;
int sz[100010];
int rt;
bool hf;

void dfs(int v, int p)
{
	sz[v] = 1;
	int mx = 0;

	for (auto e : g[v]) if (e.fi != p) {
		dfs(e.fi, v);
		mx = max(mx, sz[e.fi]);
		sz[v] += sz[e.fi];
		int t = min(sz[e.fi], N - sz[e.fi]);
		ll ad = t * 2;

		if (t * 2 == N) {
			hf = 1;
			--ad;
		}

		ret += ad * e.se;
	}

	if (p != -1) {
		mx = max(mx, N - sz[v]);
	}

	if (mx <= N/2) {
		rt = v;
	}
}

int main() {
	cin >> N;
	rep(i, N-1) {
		ll a, b, c;
		cin >> a >> b >> c;
		--a; --b;
		g[a].eb(b, c);
		g[b].eb(a, c);
	}

	dfs(0, -1);

	if (!hf) {
		ll mn = 1e9;
		for (auto e : g[rt]) {
			mn = min(mn, e.se);
		}
		ret -= mn;
	}

	cout << ret << endl;

	return 0;
}