#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vll vector<ll>
#define PB push_back
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
const ll INF = (1LL << 60);
const int MAXN = 1e6 + 10;
bool bio[MAXN];
int to[MAXN], w[MAXN];
vi g[MAXN];
ll ans, ret;
vll dp, s;
int ciklus(int u){
if(bio[u]) return u;
bio[u] = 1;
int v = ciklus(to[u]);
if(v){
dp.PB(u), s.PB(w[u]);
if(u == v) return 0;
return v;
}
bio[u] = 0;
return 0;
}
ll dfs(int u){
ll mx = 0;
bio[u] = 1;
for(int &x : g[u]){
if(bio[x]) continue;
ll ch = w[x] + dfs(x);
ret = max(ret, ch + mx);
mx = max(mx, ch);
}
return mx;
}
void resi(int u){
dp.clear(), s.clear();
ciklus(u);
int sz = s.size();
reverse(all(dp));
reverse(all(s));
for(ll &x : dp) x = (ll)dfs(x);
for(int i = sz - 1; i; i--) swap(s[i], s[i - 1]);
FOR(i, 1, sz) s[i] += s[i - 1];
ll m1 = -INF, m2 = -INF;
REP(i, sz){
ret = max(ret, dp[i] + s[i] + m1);
ret = max(ret, s[sz - 1] + m2 + dp[i] - s[i]);
m1 = max(m1, dp[i] - s[i]);
m2 = max(m2, dp[i] + s[i]);
}
ans += ret;
ret = 0;
}
void solve(){
int n;
cin >> n;
FOR(i, 1, n + 1) cin >> to[i] >> w[i], g[to[i]].PB(i);
FOR(i, 1, n + 1) if(!bio[i]) resi(i);
cout << ans << "\n";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
//cin >> t;
while(t--)solve();
return 0;
}
