#include <iostream>
#include <cstdio>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int mx[N], siz[N], n, head[N], tot, ans, mxsiz = 0x3f3f3f3f;
struct node{int to, nex, val;}a[N << 1];
inline int read()
{
	int x = 0, f = 1; char ch = getchar();
	while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
	while(ch >= '0' && ch <= '9') {x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar();}
	return x * f;
}
void add(int x, int y, int z) {a[++ tot].to = y; a[tot].nex = head[x]; head[x] = tot; a[tot].val = z;}
void dfs(int x, int fa)
{
	siz[x] = 1;
	for(int i = head[x]; i; i = a[i].nex)
	{
		int y = a[i].to; if(y == fa) continue;
		dfs(y, x); siz[x] += siz[y];
		mx[x] = max(mx[x], siz[y]);
		ans += 2 * a[i].val * min(siz[y], n - siz[y]);
	}
	mx[x] = max(mx[x], n - siz[x]);
	mxsiz = min(mxsiz, mx[x]);
}
void work()
{
	n = read();
	for(int i = 1, x, y, z; i <= n - 1; i ++)
	{
		x = read(); y = read(); z = read();
		add(x, y, z); add(y, x, z);
	}
	dfs(1, 0); int g1 = 0, g2 = 0;
	for(int i = 1; i <= n; i ++)
	{
		if(mx[i] != mxsiz) continue;
		if(!g1) g1 = i; else g2 = i;
	}
	int em = 0x3f3f3f3f;
	for(int i = head[g1]; i; i = a[i].nex)
	{
		int y = a[i].to;
		if(g2 && y != g2) continue;
		em = min(em, a[i].val);
	}
	cout << ans - em << endl;
}
signed main() {return work(), 0;}
