#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <bitset>
   
using namespace std;
   
 
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define COPY(dest, src) memcpy(dest, src, sizeof(dest))
#define ten(n) ((long long)(1e##n))
#define bin(n) (1ull << (n))
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define revrep(i, n) for (int i = (n); i >= 0; --i)
#define pb push_back

template <class T> void chmax(T& a, const T& b) { a = max(a, b); }
template <class T> void chmin(T& a, const T& b) { a = min(a, b); }

template <class T> void uniq(T& c) { sort(c.begin(), c.end()); c.erase(unique(c.begin(), c.end()), c.end()); }
 
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }
  
template <class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p) { os << "( " << p.first << ", " << p.second << " )"; return os; }
  
template <class T> void print(T a, int n, const string& deli = " ", int br = 1) { for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } while (br--) cout << endl; }
template <class T> void print(const T& c, const string& deli = " ", int br = 1) { foreach (it, c) { cout << *it; if (++it != c.end()) cout << deli;--it; } while (br--) cout << endl; }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) {    if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }
   
template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }

void fix_pre(int n) { cout.setf(ios::fixed, ios::floatfield); cout.precision(10); }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
#define trace(x) (cout << #x << ": " << (x) << endl)
 
bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }


typedef long long ll;
typedef pair<int, int> pint;
 
// y(v): v>^<  y(^): ^>v<
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };

const double PI = acos(-1.0);


struct Edge
{
    int to, t, m, v;
};
vector<Edge> g[305];
int prev[610];
ll t[610], m[610], v[610];
void dfs(int pos, int par, int& n)
{
    prev[n] = -1;

    rep(i, g[pos].size())
    {
        const Edge& e = g[pos][i];
        if (e.to != par)
        {
            t[n] = e.t, m[n] = e.m, v[n] = e.v;
            int prev_n = n++;

            dfs(e.to, pos, n);

            prev[n] = prev_n;
        }
    }

    ++n;
}
int main()
{
    int _n, T;
    cin >> _n >> T;
    T /= 2; // round
    rep(i, _n - 1)
    {
        int a, b, _t, _m, _v;
        cin >> a >> b >> _t >> _m >> _v;
        --a, --b;
        g[a].pb((Edge){ b, _t, _m, _v });
        g[b].pb((Edge){ a, _t, _m, _v });
    }

    int n = 0;
    dfs(0, -1, n);

    const ll inf = ten(16);
    static ll dp[610][ten(4) / 2 + 10];
    erep(i, n) erep(j, T)
        dp[i][j] = -inf;
    dp[0][0] = 0;

    rep(i, n)
    {
        if (prev[i] != -1)
        {
            // ignore subtree
            erep(j, T)
                chmax(dp[i][j], dp[prev[i]][j]);
        }

        if (m[i] == 0)
        {
            for (int j = 0; j + t[i] <= T; ++j)
                chmax(dp[i + 1][j + t[i]], dp[i][j]);
        }
        else
        {
            bool odd_m = m[i] & 1;
            v[i] *= 2, m[i] /= 2; // round

            for (int peri = 0; peri < t[i]; ++peri)
            {
                // (round, val)
                // q[i].first < q[i + 1].first && q[i].second > q[i + 1].second
                static deque<pair<int, ll> > q;
                q.clear();
                for (int round = 0; peri + round * t[i] <= T; ++round)
                {
                    int j = peri + round * t[i];

                    if (!q.empty() && round - q.front().first > m[i])
                        q.pop_front();

                    // need at least one round
                    if (!q.empty() && round - q.front().first > 0)
                        chmax(dp[i + 1][j], q.front().second + round * v[i]);

                    ll val = dp[i][j] - round * v[i];
                    while (!q.empty() && q.back().second <= val)
                        q.pop_back();
                    q.push_back(make_pair(round, val));

                    if (odd_m && round - q.front().first == m[i] && j + t[i] <= T)
                        chmax(dp[i + 1][j + t[i]], q.front().second + round * v[i] + v[i] / 2);
                }
            }
        }
    }

    ll res = 0;
    erep(j, T)
        chmax(res, dp[n][j]);
    cout << res << endl;
}

Measured memory_bytes: 24840