#include <stdio.h>
#include <stdlib.h>
using namespace std;

int n,i,j,k,u,v,c,root,val;
int son[100005],Next[200005],ed[200005],len[200005],tot;
int size[100005],heavy[100005];
bool vis[100005];
long long ans;

void dfs(int x)
{
	vis[x]=true;
	size[x]=1;
	for(int i=son[x];i;i=Next[i])
	if(!vis[ed[i]])
	{
		dfs(ed[i]);
		size[x]+=size[ed[i]];
		if(size[ed[i]]>heavy[x])heavy[x]=size[ed[i]];
	}
	if(n-size[x]>heavy[x])heavy[x]=n-size[x];
	if(heavy[x]<val)val=heavy[x],root=x;
	vis[x]=false;
}

void dfs2(int x,long long deep)
{
	vis[x]=true;
	size[x]=1;ans+=deep*2;
	for(int i=son[x];i;i=Next[i])
	if(!vis[ed[i]])
	{
		dfs2(ed[i],deep+len[i]);
		size[x]+=size[ed[i]];
	}
}

int main()
{
	scanf("%d",&n);
	for(i=1;i<n;++i)
	{
		scanf("%d%d%d",&u,&v,&c);
		++tot;Next[tot]=son[u];son[u]=tot;ed[tot]=v;len[tot]=c;
		++tot;Next[tot]=son[v];son[v]=tot;ed[tot]=u;len[tot]=c;
	}
	val=n;
	dfs(1);
	dfs2(root,0);
	val=1000000000;
	for(i=son[root];i;i=Next[i])
	if(size[ed[i]]==n/2&&n%2==0)
	{
		printf("%lld\n",ans-len[i]);
		return 0;
	}
	else
	{
		if(len[i]<val)val=len[i];
	}
	printf("%lld\n",ans-val);
}