#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const long double PI = 3.14159265;
long long int powerWithMod(long long int base, long long int exponent,
                           long long int modulus = LLONG_MAX) {
  long long int result = 1;
  base %= modulus;
  while (exponent > 0) {
    if (exponent % 2 == 1) result = (result * base) % modulus;
    exponent >>= 1;
    base = (base * base) % modulus;
  }
  return result;
}
long long int modInverse(long long int a, long long int m = MOD) {
  return powerWithMod(a, m - 2, m);
}
int n, x, y, z, ans;
vector<pair<int, int> > adj[123];
void dfs(int v, int par, int val) {
  if (adj[v].size() == 1 && adj[v][0].first == par) {
    ans = max(ans, val);
    return;
  }
  for (pair<int, int> x : adj[v])
    if (x.first != par) dfs(x.first, v, val + x.second);
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 1; i < n; i++) {
    cin >> x >> y >> z;
    adj[x].push_back({y, z});
    adj[y].push_back({x, z});
  }
  dfs(0, 0, 0);
  cout << ans << "\n";
  return 0;
}
