/*
* author : Apiram
* created: 11.08.2024 14:11:10
*/
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n,s;cin>>n>>s;
vector<pair<long long,long long>>arr(n + 1);
vector<vector<long long>>adj(n + 1);
for (long long i = 1;i<=n;++i){
cin>>arr[i].first>>arr[i].second;
adj[arr[i].second].push_back(i);
}
vector<pair<long long,long long>>pos;
function<void(long long,long long,long long,long long)>dfs = [&](long long u,long long mn,long long profit,long long cost){
if (profit > 0){
pos.push_back({mn,profit});
profit = 0;
}
for(auto x:adj[u]){
dfs(x,min(mn,cost + arr[x].first),profit + arr[x].first,cost + arr[x].first);
}
};
dfs(0,0,0,0);
sort(pos.rbegin(),pos.rend());
long long k = s;
for (auto x:pos){
if (x.first + k < 0)break;
k+=x.second;
}
cout<<k - s<<'\n';
return 0;
}
