#include<bits/stdc++.h>
#define fi first
#define se second
#define pitem item*
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=1e6+10;
const int SS=1<<19;
const int INFi=2e9;
const ll INFl=1e16;
const ll mod2=998244353;
const ll mod=1e9+7;
const ll mod3=2027865967;
const ll p=70032301;
const ull p2=913;
const int L=20;
int t[N],n,dkg[N],li,sp[N];
ll mini[N];
vi curr,graf[N];
bool vis[N],vis2[N],nn[N];
void dfs(int v){
    if(vis2[v]){
        sp[v]=++li;
        nn[v]=1;
        for(int i=curr.size()-1;curr[i]!=v;i--){
            nn[curr[i]]=1;
        }
        return;
    }
    if(vis[v]) return;
    vis[v]=1,vis2[v]=1;
    curr.push_back(v);
    dfs(dkg[v]); 
    sp[v]=sp[dkg[v]];
    curr.pop_back();
    vis2[v]=0;
}
void solve(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>dkg[i]>>t[i];
        graf[dkg[i]].push_back(t[i]);
    }
    for(int i=1;i<=n;i++){
        if(!vis[i]){
            dfs(i); 
        } 
    }
    ll ans=0;
    for(int i=1;i<=n;i++){
        sort(graf[i].begin(),graf[i].end());
        if(!nn[i]){
            for(int i2=0;i2<(int)graf[i].size()-1;i2++){
                ans+=graf[i][i2];
            }
        } 
    }
    for(int i=1;i<=li;i++) mini[i]=INFl;
    for(int i=1;i<=n;i++){
        if(!nn[i]) continue;
        ll ile=0,ost=0;
        bool byl=0;
        for(auto u:graf[dkg[i]]){
            if(u==t[i] and !byl){
                byl=1;
                continue;
            } 
            ile+=u;
            ost=u;
        }
        ile+=t[i];
        ile-=ost;
        ll ile2=0;
        for(auto u:graf[dkg[i]]){
            ile2+=u;
        }
        ile2-=graf[dkg[i]][graf[dkg[i]].size()-1];
        ans+=ile2;
        mini[sp[i]]=min(mini[sp[i]],ile-ile2);
    }
    for(int i=1;i<=li;i++) ans+=mini[i];
    cout<<ans<<"\n";
}
int main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    int tt=1;
    while(tt--) solve();
}