#include <bits/stdc++.h>

#define MAXN (100010)
#define ll long long

int n, root, minsz;
std::vector<std::pair<int, int> > vec[MAXN];
int sz[MAXN];
ll ans;
bool two_cen;

void dfs(int u, int fa){
	sz[u] = 1;
	int nowsz = 0;
	for(auto p : vec[u]){
		int v = p.first, w = p.second;
		if(v == fa) continue;
		dfs(v, u);
		sz[u] += sz[v];
		nowsz = std::max(nowsz, sz[v]);
		
		int k = std::min(sz[v], n - sz[v]);
		ans += 2ll * k * w;
		
		if(k == n - k){
			two_cen = true;
			ans -= w;
		}
	}
	nowsz = std::max(nowsz, n - sz[u]);
	if(minsz > nowsz){
		minsz = nowsz;
		root = u;
	}
}

int main(){
	scanf("%d", &n);
	for(int i = 1; i < n; ++ i){
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c);
		vec[a].push_back({b, c});
		vec[b].push_back({a, c});
	}
	minsz = INT_MAX;
	dfs(1, 0);
	
	if(!two_cen){
		int minw = INT_MAX;
		for(auto p : vec[root]){
			minw = std::min(minw, p.second);
		}
		ans -= minw;
	}
			
	printf("%lld\n", ans);
	return 0;
}