#include<bits/stdc++.h>
using namespace std;

const int maxn = 1e5+5;

int n, m;
int B[maxn], C[maxn], L[maxn];
long long ans = 0;
long long sum[maxn];

vector<int> g[maxn];

priority_queue<int> pq[maxn];

void dfs(int x){
    pq[x].push(C[x]);
    sum[x] = C[x];
    for(auto v: g[x]){
        dfs(v);
        if(pq[v].size() > pq[x].size()){
            pq[x].swap(pq[v]);
        }
        sum[x] += sum[v];
        while(!pq[v].empty()){
            pq[x].push(pq[v].top());
            pq[v].pop();
        }
    }
    while(sum[x] > m){
        sum[x] -= pq[x].top();
        pq[x].pop();
    }
    ans = max<long long>(ans, 1LL*pq[x].size()*L[x]);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> B[i] >> C[i] >> L[i];
        g[B[i]].push_back(i);
    }
    dfs(0);
    cout << ans;
}