#include <bits/stdc++.h>
using namespace std;

#define eb emplace_back

using ii = pair<int, int>;
using ll = long long;

int n;
ll ans;
vector<ii> ed[35];

namespace ufds {
	int lnk[100005], sz[100005];
	priority_queue<ii, vector<ii>, greater<ii> > pq[100005];
	
	void init(int n) {
		iota(lnk + 1, lnk + 1 + n, 1);
		fill(sz + 1, sz + 1 + n, 1);
	}
	int find(int x) {
		if (x == lnk[x]) {
			return x;
		}
		return lnk[x] = find(lnk[x]);
	}
	void unite(int a, int b) {
		a = find(a);
		b = find(b);
		if (a == b) {
			return;
		}
		if (sz[b] > sz[a]) {
			swap(a, b);
		}
		sz[a] += sz[b];
		lnk[b] = a;
	}
};

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	ufds::init(n);
	for (int i = 1, u, v, w; i < n; i++) {
		cin >> u >> v >> w;
		ed[w].eb(u, v);
	}
	for (int w = 0; w <= 30; w++) {
		for (auto [u, v] : ed[w]) {
			int u_sz = ufds::sz[ufds::find(u)];
			int v_sz = ufds::sz[ufds::find(v)];
			if (u_sz > v_sz) {
				swap(u, v);
				swap(u_sz, v_sz);
			}
			if (u_sz == v_sz) {
				ufds::unite(u, v);
				while (!ufds::pq[ufds::find(v)].empty()) {
					ufds::pq[ufds::find(v)].pop();
				}
				ufds::pq[ufds::find(v)].emplace(w, 2 * u_sz - 1);
			} else {
				int old_rep = ufds::find(v);
				ufds::unite(u, v);
				swap(ufds::pq[ufds::find(u)], ufds::pq[old_rep]);
				// u_sz < v_sz
				for (int cur = u_sz; cur; ) {
					auto tmp = ufds::pq[ufds::find(v)].top();
					ufds::pq[ufds::find(v)].pop();
					if (tmp.second <= cur) {
						cur -= tmp.second;
					} else {
						ufds::pq[ufds::find(v)].emplace(tmp.first, tmp.second - cur);
						cur = 0;
					}
				}
				ufds::pq[ufds::find(v)].emplace(w, 2 * u_sz);
			}
		}
	}
	while (!ufds::pq[ufds::find(1)].empty()) {
		auto tmp = ufds::pq[ufds::find(1)].top();
		ufds::pq[ufds::find(1)].pop();
		ans += (1ll << tmp.first) * tmp.second;
	}
	cout << ans << '\n';
}