#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
    int n;cin>>n;
    vector<vector<pair<int,int>>>connect(n);
    for(int i=0;i<n-1;i++){
        int a,b,c;cin>>a>>b>>c;
        a--;b--;
        connect[a].push_back({b,c});
        connect[b].push_back({a,c});
    }
    //関数の返り値->遠い奴のコストも一緒に
    const int inf=1e18;
    auto BFS=[&](auto BFS,int start)->pair<int,int>{
        vector<bool>vis(n,false);
        vector<int>dist(n,inf);
        dist[start]=0;
        priority_queue<pair<int,int>>que;
        que.push({0,start});
        while(!que.empty()){
            auto[w,now]=que.top();
            que.pop();
            if(vis[now])continue;
            if(w>dist[now])continue;
            vis[now]=true;
            for(auto[to,ww]:connect[now]){
                if(!vis[to]){
                    if(dist[to]>dist[now]+ww){
                        dist[to]=dist[now]+ww;
                        que.push({dist[to],to});
                    }
                }
            }
        }
        int ret=0,ret2=0;
        for(int i=0;i<n;i++){
            if(ret2<dist[i]){
                ret2=dist[i];
                ret=i;
            }
        }
        return {ret,ret2};
    };
    auto[nxt,w]=BFS(BFS,0);
    auto[d,ans]=BFS(BFS,nxt);
    cout<<ans<<endl;
}