#include<bits/stdc++.h>

using namespace std;

const int N = ;

struct edge {

    int to;

    long long w;

    edge(int to = , long long w = ) : to(to), w(w) {}

};

int n;

long long L;

long long dis[N], tag[N];

int root[N], l[N], r[N], d[N], ans[N], size[N];

vector<edge> G[N];

void pushdown(int x)

{

    if(tag[x] == ) return;

    tag[l[x]] += tag[x];

    dis[l[x]] += tag[x];

    tag[r[x]] += tag[x];

    dis[r[x]] += tag[x];

    tag[x] = ;

}

int merge(int u, int v)

{

    if(!u) return v;

    if(!v) return u;

    pushdown(u);

    pushdown(v);

    if(dis[u] < dis[v]) swap(u, v);

    r[u] = merge(r[u], v);

    if(d[r[u]] > d[l[u]]) swap(l[u], r[u]);

    d[u] = d[l[u]] + ;

    size[u] = size[l[u]] + size[r[u]] + ;

    return u;

}

void dfs(int u)

{

    root[u] = u;

    size[u] = ;

    for(int i = ; i < G[u].size(); ++i)

    {

        edge e = G[u][i];

        dfs(e.to);

        tag[root[e.to]] += e.w;

        dis[root[e.to]] += e.w;

        root[u] = merge(root[u], root[e.to]);

    }

    while(dis[root[u]] > L && root[u]) root[u] = merge(l[root[u]], r[root[u]]);

    ans[u] = size[root[u]];

}

int main()

{

    scanf("%d%lld", &n, &L);

    for(int i = ; i <= n; ++i)

    {

        int u;

        long long len;

        scanf("%d%lld", &u, &len);

        G[u].push_back(edge(i, len));

    }

    dfs();

    for(int i = ; i <= n; ++i) printf("%d\n", ans[i]);

    return ;

}