#include <bits/stdc++.h>
using namespace std;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
const long long INFll = 1ll * 1000000000 * 1000000000;
const long double PI =
    3.141592653589793238462643383279502884197169399375105820974944;
int mul(int a, int b, int mod = 1000000007) { return int(a * 1ll * b % mod); }
int norm(int a, int mod = 1000000007) {
  while (a >= mod) a -= mod;
  while (a < 0) a += mod;
  return a;
}
int powmod(int x, int y, int mod = 1000000007) {
  int res = 1;
  while (y > 0) {
    if (y & 1) res = mul(res, x, mod);
    x = mul(x, x, mod);
    y = y >> 1;
  }
  return res;
}
int inv(int a, int mod = 1000000007) { return powmod(a, mod - 2); }
long long res = 0;
vector<pair<int, int> > v[100005];
void dfs(int u, int p, long long dist) {
  for (auto e : v[u]) {
    if (e.first != p) {
      dfs(e.first, u, dist + e.second);
    }
  }
  if (v[u].size() == 1) {
    res = max(res, dist);
  }
}
int main() {
  int n;
  cin >> n;
  long long ans = 0;
  for (int i = 0; i < n - 1; i++) {
    int x, y, z;
    cin >> x >> y >> z;
    v[x].push_back(make_pair(y, z));
    v[y].push_back(make_pair(x, z));
    ans = ans + 2 * z;
  }
  dfs(1, 1, 0);
  ans -= res;
  cout << ans;
  return 0;
}
