#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#pragma GCC optimize ("O3")
	#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};


typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}

// 検証しなおしたい

//library
typedef long long cost_t;

class Edge {
public:
	int to = -1;
	cost_t cost = -1;
	
	Edge(){
	}

	Edge(int x,cost_t y){
		to = x;
		cost = y;
	}

	// Edge(int x, int y, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// }

	// Edge(int x, int y, int r, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// 	// rev = r;
	// }

	bool operator< (const Edge& x) const {
		if(cost != x.cost) return cost < x.cost;
		return to < x.to;
	}

	bool operator> (const Edge& x) const {
		if(cost != x.cost) return cost > x.cost;
		return to > x.to;
	}
};

class Graph {
private:
	typedef vector<Edge> Edges;
	//const long long int INF = (long long)1e18;
	vector<Edges> v; 
	int n;
public:
	Graph(int x){
		n = x;
		v = vector<Edges>(x);
	}

	Graph(){}

	Edges& operator[](int x){
		return v[x];
	}

	const Edges& operator[](int x) const {
		return v[x];
	}

	int size() const {
		return n;
	}

	void add_edge(int from, const Edge &e){
		v[from].push_back(e);
	}

	void add_edge(int from, int to, cost_t cost = -1){
		add_edge(from,Edge(to,cost));
	}

	// void add_edge(int from, int to, cost_t cost = -1, int rev = -1){
	// 	add_edge(from,Edge(from,to,rev,cost));
	// }

	void add_uedge(int from, int to, cost_t cost = -1){
		add_edge(from,to,cost);
		add_edge(to,from,cost);
	}
};



class GraphVizualizer{
	int cnt;
public:
	GraphVizualizer(){
		cnt = 0;
	}

	void operator() (const Graph &g, bool with_dir = true, bool with_cap = false){
		ofstream ofs("./out.dot");
		if(!with_dir) ofs << "graph graph_name {" << endl;
		else ofs << "digraph graph_name {" << endl;
		for(int i = 0; i < (int)g.size(); ++i) {
			ofs << "    " << i << "[];" << endl;
		}
		for(int i = 0; i < (int)g.size(); i++){
			if (!g[i].size())
				continue;
			for(const auto &e : g[i]){
				if(!with_dir){
					if(e.to > i) ofs << "    " << i << " -- " << e.to ; 
				}else ofs << "    " << i << " -> " << e.to ; 
				
				if (with_cap) {
					ofs << " [ label = \"" << (e.cost  == INF ? "inf" : to_string(e.cost)) << "\"];"; 
				}
				if(with_dir or e.to > i)ofs << endl;
			}
		}
		ofs << "}" << endl;
		ofs.close();
		string cmd = "dot -T png out.dot > ";
		cmd = cmd+"sample"+to_string(cnt)+".png";
		system(cmd.c_str());	
		cnt++;
	}
};



int main()
{
	ios_init();
	int n;
	// GraphVizualizer viz;
	const LL INF = 1e15;
	while(cin >> n) {
		Graph g(n);
		LL mi = INF;
		REP(i, n - 1) {
			int a, b;
			LL c;
			cin >> a >> b >> c;
			a--; b--;
			g.add_uedge(a, b, c);
			chmin(mi, c);
		}
		// viz(g ,true, true);


		vector<int> ss(n);
		vector<int> prev(n);
		function<void(int, int)> recc = [&](int v, int pre) {
			prev[v] = pre;
			for(auto&& e : g[v]) {
				if(e.to == pre) {
					continue;
				}
				recc(e.to, v);
				ss[v] += ss[e.to];
			}
			ss[v]++;
		};
		recc(0, -1);

		
		function<void(int, int)> rec = [&](int v, int pre) {
			REP(i, SZ(g[v])) {

			}
		};

		// vector<vector<LL>> dp(n, vector<LL>(3, -1));
		// function<LL(int, int, int, int)> rec = [&](int v, int pre, int c, int s) {
		// 	if(dp[v][s] != -1) return dp[v][s];
		// 	DEBUG(v); DEBUG(s); DEBUG(c);
		// 	int sum = c  + 1;
		// 	int ma = c;
		// 	LL mai = -1;
		// 	for(auto&& e : g[v]) {
		// 		if(e.to == pre) continue;
		// 		sum += ss[e.to];
		// 		if(chmax(ma, ss[e.to])) {
		// 			mai = e.to;
		// 		}
		// 	}
		// 	LL res = 0;
		// 	for(auto&& e : g[v]) {
		// 		if(e.to == pre) continue;
		// 		int c;
		// 		if(mai == e.to && ma > sum / 2) {
		// 			c = sum - ma;
		// 		} else {
		// 			c = ss[e.to];
		// 		}
		// 		res += e.cost * c * 2;
		// 		res += rec(e.to, v, c, 0);
		// 	}

		// 	return dp[v][s] = res;
		// };

		LL sum = 0;
		REP(i, n) {
			for(auto&& e : g[i]) {
				if(e.to == prev[i]) continue;
				sum += e.cost * min(n - ss[e.to], ss[e.to]) * 2;
			}
		}
		DEBUG(sum);


		LL ans = 0;
		vector<LL> dpp(n);
		function<void(int, int)> recp = [&](int v, int pre) {
			for(auto&& e : g[v]) {
				if(e.to == pre) continue;
				recp(e.to, v);
				dpp[v] += dpp[e.to] + e.cost * min(n - ss[e.to] - 1, ss[e.to]) * 2;
			}
		};
		recp(0, -1);

		// vector<LL> dp1(n);
		function<void(int, int, LL)> rec0 = [&](int v, int pre, LL sum) {
			
			for(auto&& e : g[v]) {
				if(e.to == pre) continue;
				LL nsum = sum + dpp[v] - dpp[e.to] - e.cost * min(n - ss[e.to] - 1, ss[e.to]) * 2 + e.cost * min(n - ss[e.to], ss[e.to] - 1) * 2 ;
				LL ec = e.cost * (2 * min(n - ss[e.to], ss[e.to]) - 1);
				LL a =  dpp[v] - e.cost * min(n - ss[e.to] - 1, ss[e.to]) * 2 + ec;
				DEBUG(v); DEBUG(e.to);
				DEBUG(sum);
				DEBUG(a);
				DEBUG(ec);
				DEBUG(sum + a);
				chmax(ans, sum + a);
				rec0(e.to, v, nsum);
			}
			// return dp0[v];
		};
		rec0(0, -1, 0);

		cout << ans << endl;


		// DEBUG(sum);

		// cout << sum - mi << endl;
		// cout << rec(0, -1, 0, 0) - mi << endl;
		// REP(i, n) {
		// 	dpite(ALL(dp[i]));
		// }
	}
	return 0;
}


Measured memory_bytes: 17408