玄关：我不是开够了么

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define debug(n) cout << #n << " = " << n << '\n';
#define deb(n) cout << #n << " = " << n << "    ";
#define div() cout << "-----------------------\n";
int n;int sum;int maxn;
int head[100005],to[100005],val[100005],nxt[100005],tot;
void adde(int u, int v, int value){
	tot++;
	to[tot] = v;
	val[tot] = value;
	nxt[tot] = head[u];
	head[u] = tot;
}
int lea[100005];
void dfs(int now, int fa, int sum){
//	debug(now);
	lea[now] = sum;
	for(int i = head[now];i;i = nxt[i]){
		if(to[i] != fa){
//			debug(to[i]);
//			debug(val[i]);
			dfs(to[i],now,val[i] + sum);
		}
	}
}
signed main(){
    cin >> n;
    for(int i = 1;i < n;i++){
		int u,v,l;cin >> u >> v >> l;
		sum += l;
		adde(u,v,l);
		adde(v,u,l);
	}
	dfs(1,0,0);
	for(int i = 1;i <= n;i++){maxn = max(maxn,lea[i]);}
	cout << sum*2-maxn;
	
    return 0;
}