#ifdef MAIN 
bool __multi__ = 0;

namespace XK {

  void solve() {
  	int N; cin >> N;
  	V<V<pair<int, int>>> e(N);
  	V<AR<int, 3>> ed;
  	rep(i, N - 1) {
  		int A, B, C; cin >> A >> B >> C; -- A, -- B;
  		e[A].pb({B, C}); e[B].pb({A, C});
  		ed.pb({A, B, C});
  	}

  	auto ck = [&](int x) -> bool {
  		V<int> need(N);
  		int po = -1;
  		for(auto [u, v, w] : ed) if(w > x) {
  			need[u] = 1, need[v] = 1;
  			po = u;
  		}
  		if(po == -1) return true;

  		V<int> deg(N, 0);
  		int mx = -1, mn = LINF;

  		auto dfs = [&](auto&&dfs, int u, int fa) -> bool {
  			bool ok = need[u];
  			for(auto [v, w] : e[u]) if(v != fa) {
  				bool child = dfs(dfs, v, u);
  				if(child) {
  					deg[u] ++, deg[v] ++;
  					chmax(mx, w), chmin(mn, w);
  				}
  				ok |= child;
  			}
  			return ok;
  		};
  		dfs(dfs, po, -1);

  		int cnt = 0;
  		rep(i, N) {
  			if(deg[i] > 2) return 0;
  			if(deg[i] == 1) cnt ++;
  		}

  		if(cnt != 2) return 0;

  		return mx <= x + mn;
  	};

  	int ng = -1, ok = 1e9 + 1;
  	while(ok - ng > 1) {
  		int mid = ng + ok >> 1;
  		if(ck(mid)) ok = mid;
  		else ng = mid;
  	}
  	cout << ok;
  }
};

#else
#include "cassert"
#include "cmath"
#include "cstdint"
#include "cstdio"
#include "cstdlib"
#include "cstring"
#include "algorithm"
#include "bitset"
#include "chrono"
#include "complex"
#include "deque"
#include "functional"
#include "iostream"
#include "limits"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "sstream"
#include "string"
#include "unordered_map"
#include "unordered_set"
#include "utility"
#include "vector"
#include "array"
using namespace std;
#define int long long
using ll = long long;
using ull = unsigned long long;
const ll INF = 1ll << 60;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
template <class A, class B> bool chmax(A& l, const B& r){ return r > l ? l = r, 1 : 0; }
template <class A, class B> bool chmin(A& l, const B& r){ return r < l ? l = r, 1 : 0; }
#define sz(x) ssize(x)
#define rep(i, a) for(ll i = 0; i < (a); i ++)
#define Rep(i, a, b) for(ll i = (a); i < (b); i ++)
#define rrep(i, a, b) for(ll i = (b); i --> (a); )
#define all(x) begin(x), end(x)
#define fst first
#define snd second
#define pb push_back
template<class T> using V = vector<T>;
template<class T, std::size_t N> using AR = array<T, N>;
#define MAIN
#include __FILE__
signed main() {ios::sync_with_stdio(0);cin.tie(0);fixed(cout).precision(12);int t = 1;if(__multi__) cin >> t;while(t --) XK::solve();}
#endif