#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#define NMAX 100003
using namespace std;
int table, n, p[NMAX], s, sol[NMAX], sum[NMAX];
vector <int> v[NMAX];
void dfs(int k)
{
    for (int i = 0; i < v[k].size(); i++ )
    {
        dfs(v[k][i]);
        p[i] = sol[v[k][i]];
       
    }
    int ss = 0;
 
    sort (p , p +  v[k].size());
    int ok = 0;
     
    sol[k] = sum[k]; 
    for (int i = 0;i < v[k].size(); i++)
    {
        if (sol[k] + sol [i] <= s){
            sol[k] += sol[i];
            table++;
           
        }
    }
     
 
     
}
int main ()
{
    ifstream cin ("mese.in");
    ofstream cout ("mese.out");
    cin >> n >> s;
    int x;
    for (int i = 1;i <= n;i ++)
    {
        cin >> x >> sum[i];
        v[x].push_back (i);
    }
    dfs(0);
    cout <<n + 1 -  table;
    return 0;
}