#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif
template <typename T>
struct Fenwick {
  int n;
  std::vector<T> a;
  Fenwick(int n = 0) {
    init(n);
  }
  void init(int n) {
    this->n = n;
    a.assign(n, T());
  }
  void add(int x, T v) {
    for (int i = x + 1; i <= n; i += i & -i) {
      a[i - 1] += v;
    }
  }
  T sum(int x) {
    auto ans = T();
    for (int i = x; i > 0; i -= i & -i) {
      ans += a[i - 1];
    }
    return ans;
  }
  T rangeSum(int l, int r) {
    return sum(r) - sum(l);
  }
  int kth(T k) {
    int x = 0;
    for (int i = 1 << std::__lg(n); i; i /= 2) {
      if (x + i <= n && k >= a[x + i - 1]) {
        x += i;
        k -= a[x - 1];
      }
    }
    return x;
  }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<vector<int>> adj(n);
  vector<vector<pair<int, int>>> val(31);
  for (int i = 1; i < n; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    u--, v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
    val[w].emplace_back(u, v);
  }
  int dfn = 0;
  vector<int> in(n), out(n);
  vector<int> dep(n);
  function<void(int, int)> dfs = [&](int x, int p) {
    in[x] = dfn++;
    for (auto y : adj[x]) {
      if (y != p) {
        dep[y] = dep[x] + 1;
        dfs(y, x);
      }
    }
    out[x] = dfn;
  };
  dfs(0, -1);
  Fenwick<int> fen(n);
  for (int i = 0; i < n; i++) {
    fen.add(in[i], 1);
  }
  long long ans = 0;
  int lest = 0;
  vector<bool> vis(n);
  bool find = false;
  for (int i = 30; i >= 0 && !find; i--) {
    for (auto [u, v] : val[i]) {
      if (vis[u] || vis[v]) continue;
      if (dep[u] > dep[v]) swap(u, v);
      int v1 = n - fen.rangeSum(in[v], out[v]);
      int v2 = n - v1;
      if (v1 > v2) swap(v1, v2), swap(u, v);
      if (v2 - v1 - 1 <= lest) {
        int use = v2 - v1 - 1;
        v2 -= use, lest -= use;
        if (lest) lest--, v2--;
        v1 -= lest / 2, v2 -= (lest + 1) / 2;
        ans += (long long) (1 << i) * (v1 + v2 - 1);
        find = true;
        break;
      }
      ans += (long long) (1 << i) * (2 * v1);
      function<void(int, int)> clear = [&](int x, int p) {
        fen.add(in[x], -1);
        n -= 1;
        vis[x] = true;
        for (auto y : adj[x]) {
          if (y == p || vis[y]) continue;
          clear(y, x);
        }
      };
      clear(u, v);
      lest += v1;
    }
  }
  cout << ans << '\n';
  return 0;
}