#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 1e5 + 5;

int N;
int W[maxn];
vector<ii> G[maxn];
int child[maxn], par[maxn];
int spEdge = 0, spVert = 0;
ll ans = 0;

void dfs(int v, int pE) {
	child[v] = 1;
	int mx_child = 0;
	for (auto &e : G[v]) {
		int w, u; tie(w, u) = e;
		if (u == par[v]) continue;
		par[u] = v;
		dfs(u, w);
		child[v] += child[u]; mx_child = max(mx_child, child[u]);
	}
	if (child[v] * 2 == N) spEdge = pE;
	if (max(mx_child, N - child[v]) <= N / 2) spVert = v;
	ans += 2LL * W[pE] * min(child[v], N - child[v]);
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> N;
	for (int i = 1; i < N; ++i) {
		int u, v; cin >> u >> v >> W[i];
		G[u].push_back(ii(i, v));
		G[v].push_back(ii(i, u));
	}
	dfs(1, 0);
	if (spEdge) {
		cout << ans - W[spEdge] << endl;
	} else {
		int mn = 1e9;
		for (auto &e: G[spVert]) mn = min(mn, W[e.first]);
		cout << ans -  mn << endl;
	}
}