#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rrep2(i,n,k) for(int i=n-1;i>=n-k;i--)
#define vll(n,i) vector<long long>(n,i)
#define v2ll(n,m,i) vector<vector<long long>>(n,vll(m,i))
#define v3ll(n,m,k,i) vector<vector<vector<long long>>>(n,v2ll(m,k,i))
#define v4ll(n,m,k,l,i) vector<vector<vector<vector<long long>>>>(n,v3ll(m,k,l,i))
#define all(v) v.begin(),v.end()
#define chmin(k,m) k = min(k,m)
#define chmax(k,m) k = max(k,m)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
#define riano_ std::ios::sync_with_stdio(false);std::cin.tie(nullptr)
using Graph = vector<vector<Pr>>;

const ll mod = 998244353;
template<uint64_t mod>
struct modint{
    uint64_t val;
    constexpr modint(const int64_t val_=0) noexcept:val((val_%int64_t(mod)+int64_t(mod))%int64_t(mod)){}
    constexpr modint operator-() const noexcept{
        return modint(*this)=mod-val;
    }
    constexpr modint operator+(const modint rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint operator-(const modint rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint operator*(const modint rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint operator/(const modint rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint &operator+=(const modint rhs) noexcept{
        val+=rhs.val;
        val-=((val>=mod)?mod:0);
        return (*this);
    }
    constexpr modint &operator-=(const modint rhs) noexcept{
        val+=((val<rhs.val)?mod:0);
        val-=rhs.val;
        return (*this);
    }
    constexpr modint &operator*=(const modint rhs) noexcept{
        val=val*rhs.val%mod;
        return (*this);
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        uint64_t ex=mod-2;
        modint now=1;
        while(ex){
            now*=((ex&1)?rhs:1);
            rhs*=rhs,ex>>=1;
        }
        return (*this)*=now;
    }
    modint & operator++(){
        val++;
        if (val == mod) val = 0;
        return *this;
    }
    modint operator++(int){
        modint<mod> res = *this;
        ++*this;
        return res;
    }
    constexpr bool operator==(const modint rhs) noexcept{
        return val==rhs.val;
    }
    constexpr bool operator!=(const modint rhs) noexcept{
        return val!=rhs.val;
    }
    friend constexpr ostream &operator<<(ostream& os,const modint x) noexcept{
        return os<<(x.val);
    }
    friend constexpr istream &operator>>(istream& is,modint& x) noexcept{
        uint64_t t;
        is>>t,x=t;
        return is;
    }
};
typedef modint<mod> mint;
mint pw(long long a,long long b,long long m = mod){
    if(a%m==0) return mint(0);
    if(b==0) return mint(1);
    else if(b%2==0){
        long long x = pw(a,b/2,m).val;
        return mint(x*x);
    }
    else{
        long long x = pw(a,b-1,m).val;
        return mint(a*x);
    }
}
mint modinv(long long a, long long m = mod) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    return mint(u);
}
#define vm(n,i) vector<mint>(n,i)
#define v2m(n,m,i) vector<vector<mint>>(n,vm(m,i))
#define v3m(n,m,k,i) vector<vector<vector<mint>>>(n,v2m(m,k,i))
#define v4m(n,m,k,l,i) vector<vector<vector<vector<mint>>>>(n,v3m(m,k,l,i))


//Unionfind
//size>4e5 の時はvが足りなくなるので注意
struct unionfind {
	//自身が親であれば、その集合に属する頂点数に-1を掛けたもの
	//そうでなければ親のid
	vector<long long> r;
    vector<bool> lp;
    vector<long long> cnt;
    vector<long long> repr;
    vector<long long> per;
	unionfind(long long N,vector<long long> v=vector<long long>(4e5+2,0)) { //vで代表点の優先順位をinput
		r = vector<long long>(N, -1);
        lp = vector<bool>(N,false);
        cnt = vector<long long>(N, 0);
        repr = vector<long long>(N, -1);
        rep(i,N) repr[i] = i;
        per = v;
	}
	long long root(long long x) {
		if (r[x] < 0) return x;
		return r[x] = root(r[x]);
	}
	bool unite(long long x, long long y) {
		x = root(x);
		y = root(y);
		if (x == y){
            lp[x] = true;
            return false;
        }
        long long tmp = 0;
		if (r[x] > r[y]) swap(x, y);
        tmp = repr[x];
        if(per[repr[x]]>per[repr[y]]){
            tmp = repr[y];
        }
		r[x] += r[y];
        cnt[x] += cnt[y];
		r[y] = x;
        repr[x] = tmp;
        lp[x] = (lp[x]||lp[y]);
		return true;
	}

	long long size(long long x) {
		return max(-r[root(x)],0LL);
	}
    long long count(long long x){
        return cnt[root(x)];
    }
    long long represent(long long x){
        return repr[root(x)];
    }
  
    // 2つのデータx, yが属する木が同じならtrueを返す
    bool same(long long x, long long y) { 
        long long rx = root(x);
        long long ry = root(y);
        return rx == ry;
    }
    //閉路の存在判定
    bool loop(ll x){
        return lp[root(x)];
    }
    //重みをつける場合
    void eval(ll i,ll x){
        cnt[i] = x;
    }
    void eval_add(ll i,ll x = 1){
        cnt[i] += x;
    }
};

int main() {
    riano_; ll ans = 0;
    ll N; cin >> N;
    assert(2<=N&&N<=200000);
    //main関数内で 
    unionfind uf(N);
    rep(i,N-1){
        ll a,b,c; cin >> a >> b >> c;
        uf.unite(a-1,b-1);
        assert(1<=a&&a<=N);
        assert(1<=b&&b<=N);
        assert(1<=c&&c<=1000000000);
        chmax(ans,c);
    }
    assert(uf.size(0)==N);
    cout << ans << endl;
}