#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll

const int N = 1e5+10,mo = 1e9+7;

int a[N];

vector<pair<int,int>>to[N];
int dp[N][2];//是否余下一条链
void dfs(int u,int fa){
    
    vector<int>ve;
    
    for(auto k:to[u]){
        int v=k.first;
        if(v==fa)continue;
        dfs(v,u);
        dp[u][0]+=dp[v][0];
        ve.push_back(dp[v][1]-dp[v][0]+k.second);

    }
    sort(ve.begin(),ve.end(),greater<int>());
    if(ve.size()>=1){
        dp[u][1]=dp[u][0]+ve[0];
        for(int i=2;i<ve.size();i+=2){
            dp[u][1]=max(dp[u][1],dp[u][1]+ve[i-1]+ve[i]);
        }
    }
    for(int i=1;i<ve.size();i+=2){
        dp[u][0]=max(dp[u][0],dp[u][0]+ve[i-1]+ve[i]);
    }
    // cerr<<"u fa ="<<u<<" "<<fa<<"\n";
    // for(int i:ve)cerr<<i<<" ";cerr<<"\n";
    // cerr<<"u="<<u<<" "<<dp[u][0]<<" "<<dp[u][1]<<"\n";
}
inline void solve(){
    int n;cin>>n;
    for(int i=0;i<n-1;i++){
        int u,v,w;cin>>u>>v>>w;
        to[u].push_back({v,w});to[v].push_back({u,w});
    }
    dfs(1,0);
    cout<<max(dp[1][0],dp[1][1])<<"\n";
}



signed main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int WTN666=1;//cin>>WTN666;
    while(WTN666--){
        solve();
    }
}