#include<cstdio>
#include<cstring>
#include<algorithm>
#define LL long long
#define fo(i,j,k) for(int i=j;i<=k;i++)
#define fr(i,j) for(int i=beg[j];i;i=nex[i])
using namespace std;
int const mn=1e5+3,mm=2e5+3,inf=1e9+7;
int n,rt,gra,beg[mn],to[mm],len[mm],nex[mm],size[mn],f[mn];
LL ans;
void ins(int u,int v,int w){
	to[++gra]=v;
	len[gra]=w;
	nex[gra]=beg[u];
	beg[u]=gra;
}
void dfs(int p,int q){
	size[p]=1;
	fr(i,p)if(to[i]!=q){
		dfs(to[i],p);
		ans+=2ll*len[i]*min(size[to[i]],n-size[to[i]]);
		size[p]+=size[to[i]];
		f[p]=max(f[p],size[to[i]]);
	}
	f[p]=max(f[p],n-size[p]);
}
int main(){
	scanf("%d",&n);
	fo(i,1,n-1){
		int u,v,w;
		scanf("%d%d%d",&u,&v,&w);
		ins(u,v,w);
		ins(v,u,w);
	}
	rt=1;
	dfs(1,0);
	fo(i,2,n)if(f[i]<f[rt])rt=i;
	int mi=inf;
	fr(i,rt)if(f[to[i]]==f[rt]){
		printf("%lld",ans-len[i]);
		return 0;
	}else mi=min(mi,len[i]);
	printf("%lld",ans-mi);
	return 0;
}
