#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1000001;
int u[N];
int vidx[N];
int ucost[N];
bool in_cycle[N];
ll dp[N];
ll down[N];
array<int,3> v[2*N];
int vsz=0;
array<int,3> bad_edges[N];
int badsz=0;
int cc[N];
int ccsz=0;
int cycle[N];
int cyclesz=0;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for(int i=1;i<=n;i++) u[i]=i;
function<int(int)> find_set=[&](int a)->int
{
if(a==u[a]) return a;
else return u[a]=find_set(u[a]);
};
auto merge_sets=[&](int a,int b)->int
{
a=find_set(a);
b=find_set(b);
if(a==b) return 0;
u[b]=a;
return 1;
};
for(int a=1;a<=n;a++)
{
int b,c;
cin >> b >> c;
if(merge_sets(a,b))
{
v[vsz++]={a,b,c};
v[vsz++]={b,a,c};
}
else bad_edges[badsz++]={a,b,c};
}
sort(v,v+vsz);
for(int i=vsz-1;i>=0;i--) vidx[v[i][0]]=i;
ll res=0;
auto chmax=[&](ll &a,ll b){a=max(a,b);};
memset(u,0,sizeof(u));
for(int o=0;o<badsz;o++)
{
auto [x,y,bad_cost]=bad_edges[o];
function<void(int)> dfs=[&](int a)
{
cc[ccsz++]=a;
ll one=0,two=0;
for(int i=vidx[a];i<vsz&&v[i][0]==a;i++)
{
auto [_,to,c]=v[i];
if(to==u[a]) continue;
u[to]=a;
ucost[to]=c;
dfs(to);
ll len=c+down[to];
if(len>one){two=one; one=len;}
else if(len>two){two=len;}
chmax(dp[a],dp[to]);
chmax(down[a],len);
}
chmax(dp[a],one+two);
};
dfs(x);
ll now=dp[x];
int t=y;
while(t!=0)
{
cycle[cyclesz++]=t;
in_cycle[t]=1;
t=u[t];
}
for(int i=0;i<ccsz;i++) down[cc[i]]=dp[cc[i]]=0;
function<void(int,int)> go=[&](int a,int p)
{
for(int i=vidx[a];i<vsz&&v[i][0]==a;i++)
{
auto [_,to,c]=v[i];
if(to==p||in_cycle[to]) continue;
go(to,a);
chmax(down[a],c+down[to]);
}
};
for(int i=0;i<cyclesz;i++) go(cycle[i],0);
ll path=0;
for(int i=0;i<cyclesz;i++)
{
if(i>0) dp[cycle[i]]=dp[cycle[i-1]];
chmax(dp[cycle[i]],path+down[cycle[i]]);
path+=ucost[cycle[i]];
}
path=0;
ll opt=0;
for(int i=cyclesz-1;i>=0;i--)
{
path+=ucost[cycle[i]];
chmax(opt,path+down[cycle[i]]);
if(i>0) chmax(now,dp[cycle[i-1]]+bad_cost+opt);
}
res+=now;
ccsz=cyclesz=0;
}
cout << res << "\n";
return 0;
}
