#include <bits/stdc++.h>
using namespace std;
using lld = int64_t;
static constexpr int maxn = 100000 + 5;

vector<pair<int, int>> g[maxn];
int vis[maxn], visc;

lld gao(const vector<int> &all, int c, int lef) {
    assert (lef >= 0);
    ++visc;
    vector<vector<int>> subs;
    auto dfs = [&](auto self, int u, int f) -> void {
        subs.back().push_back(u);
        vis[u] = visc;
        for (auto [v, w] : g[u]) {
            if (v == f or w >= c) continue;
            self(self, v, u);
        }
    };
    for (int u : all) {
        if (vis[u] == visc) continue;
        subs.push_back({});
        dfs(dfs, u, u);
    }
    pair<size_t, size_t> mxs = {0, 0};
    for (size_t i = 0; i < subs.size(); ++i)
        mxs = max(mxs, pair{subs[i].size(), i});
    size_t now = all.size() - mxs.first;
    if (now + 1 >= mxs.first) {
        return lld(lef) << c;
    }
    now *= 2;
    return gao(subs[mxs.second], c - 1, lef - now) + (now << c);
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n; cin >> n;
    for (int i = 1; i < n; ++i) {
        int u, v, w; cin >> u >> v >> w;
        g[u].emplace_back(v, w);
        g[v].emplace_back(u, w);
    }
    vector<int> all(n);
    iota(all.begin(), all.end(), 1);
    cout << gao(all, 30, n - 1) << '\n';
    return 0;
}