[APIO2012]派遣

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#define ll long long
#define N 100005

ll n,m;

struct P{
ll f,c,l;
ll head,sum;
P(){sum = 0;}
}T[N];

std::priority_queue<ll>QWQ[N];

ll head[N],cnt,ans;

struct E{int to,next;}e[N << 1];

inline void add(int x,int y){
	e[++cnt].to = y;
	e[cnt].next = head[x];
	head[x] = cnt;
}

inline void merge(int x,int y){//x -> y
	if(QWQ[T[x].head].size() > QWQ[T[y].head].size())
	std::swap(T[x].head,T[y].head),std::swap(T[x].sum,T[y].sum);
	while(QWQ[T[x].head].size())
	QWQ[T[y].head].push(QWQ[T[x].head].top()),T[y].sum += QWQ[T[x].head].top(),QWQ[T[x].head].pop();
}

inline void dfs(int u,int f){
//	std::cout<<u<<" "<<f<<std::endl;
	if(T[u].c <= m)
	QWQ[T[u].head].push(T[u].c),T[u].sum += T[u].c;
	for(int i = head[u];i;i = e[i].next){
		int v = e[i].to;
		if(v == f)
		continue;
		dfs(v,u);
		merge(v,u);
	}
	while(T[u].sum > m)
	T[u].sum -= QWQ[T[u].head].top(),QWQ[T[u].head].pop();
	ans = std::max((1ull) * ans, T[u].l * QWQ[T[u].head].size());
}

int main(){
	scanf("%lld%lld",&n,&m);
	for(int i = 1;i <= n;++i)
		scanf("%lld%lld%lld",&T[i].f,&T[i].c,&T[i].l),add(T[i].f,i);
	for(int i = 1;i <= n;++i)
	T[i].head = i;
	dfs(1,0);
	std::cout<<ans<<std::endl;
}