#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define w (a[e][1])
#define V() (e == u ? a[e][0] : e)
#define v V()
#define E u
const int LIM = 1e6;
vector<int> g[LIM];
array<int, 2> a[LIM];
int r, p[LIM];
ll d[LIM], s[LIM], best;
bitset<LIM> vis;
void findCycle(int u, int par){
vis[u] = 1;
for(int e : g[u]) if(e != par){
if(vis[v]) return void(r = e + (vis[u] = 0));
findCycle(v, e);
if(r >= 0) break;
}
if(u != par){
if(vis[a[u][0]]) return void(r = u + (vis[u] = 0));
findCycle(a[u][0], u);
}
vis[u] = 0;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
for(int i=0; i<n; ++i){
cin >> a[i][0] >> a[i][1]; --a[i][0];
g[a[i][0]].push_back(i);
// g[i].push_back(i);
}
fill(p, p+n, -1);
ll ans = 0;
for(int z=0; z<n; ++z){
if(vis[z]) continue;
r = -1, best = 0;
findCycle(z, -1);
assert(r >= 0);
stack<int> st; st.push(r);
while(!st.empty()){
int u = st.top();
if(!vis[u]){
vis[u] = 1, s[u] = d[u];
for(int e : g[u]) if(e != r && !vis[v]){
p[v] = u;
d[v] = d[u] + (ll)w;
st.push(v);
}
if(u != r && !vis[a[u][0]]){
p[a[u][0]] = u;
d[a[u][0]] = d[u] + (ll)a[u][1];
st.push(a[u][0]);
}
}else{
ll curr = 0;
for(int e : g[u]) if(e != r){
s[u] = max(s[u], s[v]);
best = max(best, curr + s[v] - d[u]);
curr = max(curr, s[v] - d[u]);
}
if(u != r){
s[u] = max(s[u], s[a[u][0]]);
best = max(best, curr + s[a[u][0]] - d[u]);
curr = max(curr, s[a[u][0]] - d[u]);
}
st.pop();
}
}
int u = a[r][0], last = -1;
while(1){
vis[u] = 0;
s[u] = d[u];
for(int e : g[u])
if(e != r && v != p[u] && v != last) s[u] = max(s[u], s[v]);
if(u != r && a[u][0] != p[u] && a[u][0] != last) s[u] = max(s[u], s[a[u][0]]);
if(u == r) break;
last = u;
u = p[u];
}
u = r;
while(1){
vis[u] = 1;
for(int e : g[u])
if(e != r && v != p[u] && !vis[v]) last = v;
if(u != r && a[u][0] != p[u] && !vis[a[u][0]]) last = a[u][0];
s[last] = max(s[last], s[u]);
if(u == a[r][0]) break;
u = last;
last = -1;
}
u = a[r][0], last = -1;
ll res = 0;
while(u != r){
ll mx = 0;
for(int e : g[u])
if(e != r && v != p[u] && v != last) mx = max(mx, s[v] - d[u]);
if(a[u][0] != p[u] && a[u][0] != last) mx = max(mx, s[a[u][0]] - d[u]);
res = max(res, d[a[r][0]] - d[u] + mx + s[p[u]]);
last = u;
u = p[u];
}
res += a[r][1];
ans += max(best, res);
}
cout << ans;
}
