#include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 110;

int n, m;
int v[N], w[N];
vector<int> adj[N];
int f[N][N];

void add(int a, int b) {
    adj[a].push_back(b);
}

void dfs(int u) {
    for (int son : adj[u]) { // 遍历子节点
        dfs(son);

        // 分组背包
        for (int j = m - v[u]; j >= 0; j--) {  // 循环体积
            for (int k = 0; k <= j; k++) {    // 循环决策
                f[u][j] = max(f[u][j], f[u][j - k] + f[son][k]);
            }
        }
    }

    // 将物品 u 加进去
    for (int i = m; i >= v[u]; i--) f[u][i] = f[u][i - v[u]] + w[u];
    for (int i = 0; i < v[u]; i++) f[u][i] = 0;
}

int main() {
    cin >> n >> m;

    int root;
    for (int i = 1; i <= n; i++) {
        int p;
        cin >> v[i] >> w[i] >> p;
        if (p == -1) root = i;
        else add(p, i);
    }

    dfs(root);

    cout << f[root][m] << endl;

    return 0;
}