#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

bool g(vector<vector<pair<int,int>>> &G,int A,int B);

void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<vector<pair<int,int>>> G(N);
	int d,e,f=0;
	rep(i,N-1){
		int a,b,c;
		cin>>a>>b>>c;
		a--,b--;
		G[a].push_back({b,c});
		G[b].push_back({a,c});
		if(chmax(f,c)) d=a,e=b;
	}
	vector<int> seen(N);
	seen[d]=1;
	queue<int> q;
	q.push(d);
	while(!q.empty()){
		int y=q.front();
		q.pop();
		for(auto x:G[y]){
			if(x.first!=e&&seen[x.first]==0){
				seen[x.first]=1;
				q.push(x.first);
			}
		}
	}
	int A=0,B=0;
	rep(i,N){
		if(seen[i]) seen[i]=A,A++;
		else seen[i]=B-N,B++;
	}
	rep(i,N){
		if(seen[i]>=0){
			swap(seen[d],seen[i]);
			break;
		}
	}
	rep(i,N){
		if(seen[i]<0){
			swap(seen[i],seen[e]);
			break;
		}
	}
	vector<vector<pair<int,int>>> H(A),I(B);
	rep(i,N) for(auto x:G[i]){
		if(seen[i]<0&&seen[x.first]<0){
			I[seen[i]+N].push_back({seen[x.first]+N,x.second});
		}else if(seen[i]>=0&&seen[x.first]>=0){
			H[seen[i]].push_back({seen[x.first],x.second});
		}
	}
	int l=0,r=f;
	while(r-l>1){
		int med=(l+r)/2;
		if(g(H,med,f-med)&g(I,med,f-med)){
			r=med;
		}else l=med;
	}
	cout<<r<<"\n";
}

bool g(vector<vector<pair<int,int>>> &G,int A,int B){
	int n=G.size();
	vector<int> order={0};
	vector<pair<int,int>> pare(n,{-1,-1});
	pare[0]={-2,-2};
	rep(i,n){
		int a=order[i];
		for(auto x:G[a]){
			if(pare[x.first].first==-1){
				pare[x.first]={a,x.second};
				order.push_back(x.first);
			}
		}
	}
	vector<int> dp(n,INF);
	rep(i,n-1){
		int a=order[n-i-1];
		if(pare[a].second>A){
			chmin(dp[a],pare[a].second);
		}
		if(dp[a]!=INF){
			chmin(dp[a],pare[a].second);
			if(dp[pare[a].first]!=INF) dp[pare[a].first]=-1;
			else dp[pare[a].first]=dp[a];
		}
	}
	return dp[0]>=B;
}