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

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cpx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) begin(v), end(v)
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound(ALL(v), x) - (v).begin())
#define ubv(v, x) (upper_bound(ALL(v), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cerr << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cerr << #arr; FR(_i, n) cerr << ' ' << (arr)[_i]; cerr << endl;}
template <typename T, typename U>
ostream& operator<<(ostream &os, pair<T, U> p){return os << "(" << p.fs << ", " << p.sn << ")";}

const int MN = 1e5 + 5;
int n;
vpii adjList[MN];

vector<vi> groups;

void dfs(int n1, int par, int w, int id){
    groups[id].pb(n1);
    for(auto [n2, e] : adjList[n1]) if(n2 != par){
        if(e > w) continue;
        if(e == w){
            groups.pb({});
            dfs(n2, n1, w, SZ(groups)-1);
        }
        if(e < w) dfs(n2, n1, w, id);
    }
}

ll solve(int src, int w, int offs){
    assert(w >= 0);
    groups.clear(); groups.pb({});
    dfs(src, -1, w, 0);
    sort(ALL(groups), [](const vi &a, const vi &b){return SZ(a) > SZ(b);});

    int sz = 0;
    for(const vi &vec : groups) sz += SZ(vec);
    assert(offs < sz);
    if(sz-offs == 1) return 0;

    int sl = SZ(groups[0]), sr = sz-sl;
    if(sl-offs <= sr+1) return (ll) (sz-offs-1) << w;
    ll res = (ll) (sr*2) << w;
    return res + solve(groups[0][0], w-1, offs+sr);
}

int main(){
    cin.sync_with_stdio(0); cin.tie(0);
    cin >> n;
    FR(i, n-1){
        int a, b, c;
        cin >> a >> b >> c;
        a--; b--;
        adjList[a].pb({b, c});
        adjList[b].pb({a, c});
    }
    ll ans = solve(0, 30, 0);
    cout << ans << '\n';
}