#include <bits/stdc++.h>
#define ll long long
#define pqi priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>>
#define F first
#define S second
using namespace std;
const ll maxn=1e18;
ll n,s,pp[300010],p[300010];
vector<int> e[300010];
pqi dfs(int now){
pqi pq;
for(auto x:e[now]){
pqi pq2=dfs(x);
if(pq.size()<pq2.size())swap(pq,pq2);
while(!pq2.empty()){
pq.push(pq2.top());
pq2.pop();
}
}
ll need=max(0ll,-pp[now]),pf=pp[now];
while(!pq.empty()&&pf<=0){
auto [x,y]=pq.top();
pq.pop();
pf+=y;
need=max(need,x-pf);
}
while(!pq.empty()&&pq.top().F<=need+pf){
pf+=pq.top().S;
pq.pop();
}
if(pf>0)pq.push({need,pf});
return pq;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>n>>s;
pp[0]=s;
for(int i=1;i<=n;i++){
int a,b;
cin>>a>>b;
pp[i]=a;
p[i]=b;
e[b].push_back(i);
}
pqi pq=dfs(0);
ll ans=0;
while(!pq.empty()&&ans>=pq.top().F){
ans+=pq.top().S;
pq.pop();
}
cout<<ans-pp[0]<<"\n";
return 0;
}
