#include<bits/stdc++.h>
using namespace std;
ifstream fin("susss.txt");
ofstream fout("res.txt");
#define forr(i, a, b) for(int i = a; i < b; i++)
#define pb push_back
#define vt vector
#define fi first
#define se second
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define sz(v) (int)v.size()
const int mxn = 1e6, inf = 1e9, mod = 1e9 + 7, mxm = 1e5 + 5;
int n;
vt<int>adj[mxn + 1];
bool vis[mxn + 1], in[mxn + 1];
ll mxd[mxn + 1], dis[mxn + 1];
int cost[mxn + 1];
int to[mxn + 1];
ll mx, id;
vt<int>comp;
void dfs(int s, int pre, int root, ll dep){
mxd[root] = max(mxd[root], dep);
comp.pb(s);
for(int ii = 0; ii < sz(adj[s]); ii++){
int i = adj[s][ii]; ll w;
if(i == to[s])w = cost[s];
else w = cost[i];
if(i != pre && !in[i])dfs(i, s, root, dep + w);
}
}
void dfs2(int s, int pre, int root, ll dep){
queue<int>q;
q.push(s);
while(!q.empty()){
int nw = q.front(); q.pop();
if(dis[nw] > mx){
mx = dis[nw]; id = nw;
}
for(auto i: adj[s]){
ll w;
if(i == to[s])w = cost[s];
else w = cost[i];
if(dis[i] == 0 && (i == root || !in[i])){
dis[i] = dis[nw] + w;
q.push(i);
}
}
}
return;
}
void get_comp(int s){
vis[s] = 1;
for(int idd = 0; idd < sz(adj[s]); idd++){
int i = adj[s][idd];
if(!vis[i]){
get_comp(i);
}
}
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++){
int v, w; cin >> v >> w;
to[i] = v; cost[i] = w;
adj[i].pb(v); adj[v].pb(i);
}
vt<int>cyc; vt<ll>pref;
ll ans = 0;
for(int i = 1; i <= n; i++){
if(!vis[i]){
ll cand = 0;
get_comp(i);
int a = to[i], b = to[to[i]];
while(a != b){
a = to[a]; b = to[to[b]];
}
a = i;
while(a != b){
a = to[a]; b = to[b];
}
ll pp = 0;
cyc.clear(); pref.clear();
cyc.pb(a); in[a] = 1; pp += cost[a]; a = to[a];
pref.pb(0);
while(a != b){
in[a] = 1;
cyc.pb(a); pref.pb(pp); pp += cost[a]; a = to[a];
}
for(int ii = 0; ii < sz(cyc); ii++){
comp.clear();
int j = cyc[ii];
dfs(j, -1, j, 0);
mx = id = -1;
dfs2(j, -1, j, 0);
for(auto cool: comp)dis[cool] = 0;
dfs2(id, -1, j, 0);
cand = max(cand, mx);
}
ll pmx = mxd[cyc[0]];
for(int j = 1; j < sz(cyc); j++){
cand = max(cand, pref[j] + mxd[cyc[j]] + pmx);
pmx = max(pmx, -pref[j] + mxd[cyc[j]]);
}
pmx = mxd[cyc[0]];
for(int j = 1; j < sz(cyc); j++){
cand = max(cand, -pref[j] + mxd[cyc[j]] + pmx + pp);
pmx = max(pmx, pref[j] + mxd[cyc[j]]);
}
ans += cand;
}
}
cout << ans;
}
