#include <cstdio>

#define N 100050
#define INF 1000000007
#define Min(a,b) (a<b?a:b)

int eg[N*2],nxt[N*2],wi[N*2],head[N],egtot;
void addEdge(int p1,int p2,int w)
{
	eg[++egtot]=p2;
	nxt[egtot]=head[p1];
	wi[egtot]=w;
	head[p1]=egtot;
}

int len[N],sz[N];
int n;
long long ans;
void dfs(int p,int fa)
{
	sz[p]=1;
	for(int i=head[p];i;i=nxt[i])
		if(eg[i]!=fa)
		{
			len[eg[i]]=wi[i];
			dfs(eg[i],p);
			sz[p]+=sz[eg[i]];
		}
//	printf("ans+ %d*%d\n",Min(sz[p],n-sz[p]),len[p]);
	ans+=(long long)Min(sz[p],n-sz[p])*len[p]*2;
}

int findCenter(int p,int fa)
{
	for(int i=head[p];i;i=nxt[i])
		if(eg[i]!=fa && sz[eg[i]]*2>=n)
			return findCenter(eg[i],p);
	return p;
}

int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n-1;i++)
	{
		int p1,p2,w;scanf("%d%d%d",&p1,&p2,&w);
		addEdge(p1,p2,w);
		addEdge(p2,p1,w);
	}
	dfs(1,0);
	int ctr=findCenter(1,0);
	if(sz[ctr]*2==n)
		ans-=len[ctr];
	else
	{
		int minl=INF;
		for(int i=head[ctr];i;i=nxt[i])
			minl=Min(minl,wi[i]);
		ans-=minl;
	}
	printf("%lld\n",ans);
}
