#include<bits/stdc++.h>
using namespace std;
struct node{
    int f,s,lei;
    vector<int> ez;
}tree[100005]; 

int n,p,w;

void dfs1(int x){
    tree[x].s=1;
    for(int i=0;i<tree[x].ez.size();i++){
        dfs1(tree[x].ez[i]);
        tree[x].s+=tree[tree[x].ez[i]].s;
    }
}
int ans=0;
bool vis[100005];
int dfs2(int x,int fen,int s,int num){
    if(num==tree[x].s) vis[x]=1;
    ans=max(ans,s);
    if(!vis[x]) dfs2(x,fen,s+(num-1)*num/2-tree[x].s*(tree[x].s-1)/2-tree[x].lei,tree[x].s);
    for(int i=0;i<tree[x].ez.size();i++){
        dfs2(tree[x].ez[i],fen,s,num);
    }
    if(fen){
        for(int i=0;i<tree[x].ez.size();i++)
        {
            for(int j=i+1;j<tree[x].ez.size();j++){
                //
            }
        }
    }
    
}
int main(){
    //dfs烂摊子不搞了 
    freopen("delete.in","r",stdin);
    freopen("delete.out","w",stdout);
    scanf("%d",&n);
    for(int i=2;i<=n;i++){
        scanf("%d%d",&p,&w);
        tree[i].f=p;
        tree[i].lei=w;
    }
    dfs1(1);
    dfs2(1,1,0,tree[1].s);
    cout<<ans;
    return 0;   
}