基环森林

//#define LOCAL
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
int n;
//前向星
int head[1000005], cnt;
struct e{
    int t, next;
    ll w;
}edge[2000005];
void add(int f, int t, ll w)
{
    edge[cnt].t = t;
    edge[cnt].w = w;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
//寻找基环
int dfn[1000005], path[1000005], times;
int vertex[1000005], circle[1000005], tot;
void dfs1(int u ,int id)
{
    dfn[u] = ++ times;
    for(int i = head[u] ; i != -1; i = edge[i].next)
    {
        int v = edge[i].t;
        if(i != id)
        {
            if (!dfn[v])
                path[v] = u, dfs1(v,i^1);//前向星选手都懂
            else if (dfn[v] > dfn[u])//tarjan原理
            {
                for(int j = v ; j != u ; j = path[j])
                    vertex[++ tot] = j , circle[j] = 1;
                vertex[++ tot] = u , circle[u] = 1;
            }
        }
    }
}
//处理每环上节点子树的直径
ll d[1000005], mx;
void dp(int u, int fa)
{
    for(int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t, w = edge[i].w;
        if(v != fa && !circle[v])//不是环上的点
        {
            dp(v,u);
            mx = max(mx,d[u] + d[v] + w);
            d[u] = max(d[u],d[v] + w);
        }
    }
}
//环拆链前缀和
int link[2000005], len, que[2000005];
ll sum[2000005], ans = 0;
void dfs2(int u , int now , int id)
{
    if(now == len) return;
    for(int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t, w = edge[i].w;
        if(v == link[now+1] && id != i)
        {
            sum[now] = sum[now - 1] + w;
            dfs2(v,now+1,i^1);
            return ;
        }
    }
}
//处理每一个联通块的基环树最长路径
void work(int u)
{
    mx = tot = 0;
    dfs1(u,-1);
    for(int i = 1 ; i <= tot ; i ++)
        dp(vertex[i],0);
    for(int i = 1 ; i <= tot ; i ++)
        link[i] = link[i+tot] = vertex[i];
    len = tot + tot;
    dfs2(vertex[1],1,0);
    int l = 1 , r = 0;
    //单调队列优化
    for(int i = 1 ; i <= len ; i ++)
    {
        while(l<=r&&i-que[l]>=tot)++l;
        if(l<=r&&sum[i-1]-sum[que[l]-1]+d[link[que[l]]]+d[link[i]]>mx)
            mx=sum[i-1]-sum[que[l]-1]+d[link[que[l]]]+d[link[i]];
        while(l<=r&&(i-que[r]>=tot||sum[i-1]+d[link[que[r]]]<sum[que[r]-1]+d[link[i]]))
            --r;
        que[++r]=i;
    }
    ans += mx;
}
int main(void)
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("odata.out", "w", stdout);
#endif
    mem(head,-1);
    cin>>n;
    int v;
    ll w;
    for(int i = 1 ; i <= n ; i ++)
    {
        scanf("%d %lld", &v, &w);
        add(i,v,w);
        add(v,i,w);
    }
    for(int i = 1 ; i <= n ; i ++)
    {
        if(!dfn[i])
            work(i);
    }
    cout<<ans<<endl;
}
/*
 1110111

 0010010

 1011101

 1011011

 0111010

 1101011

 1101111

 1010010

 1111111

 1111011

 */