#include <iostream>
#include <vector>

using namespace std;

void solve() {
    int n, k;
    cin >> n >> k;

    vector<vector<pair<int, int>>> graph(n);
    for (int i = n - 1; i--;) {
        int u, v, c;
        cin >> u >> v >> c;
        --u, --v;

        graph[u].emplace_back(v, c);
        graph[v].emplace_back(u, c);
    }

    int sum = 0;
    vector<pair<int, int>> ps;
    {
        auto dfs = [&](auto&& f, int v, int p) -> int {
            int cnum = 0;

            for (auto [u, c] : graph[v]) {
                if (u == p) continue;

                auto ccnum = f(f, u, v);
                sum += c * ccnum;
                ps.emplace_back(c, c * ccnum);
                cnum += ccnum;
            }

            if (cnum == 0) cnum = 1;
            return cnum;
        };
        dfs(dfs, 0, -1);
    }

    vector<int> dp(k + 1, 0);
    for (auto [w, v] : ps) {
        for (int i = k; i >= w; --i) {
            dp[i] = max(dp[i], dp[i - w] + v);
        }
    }
    cout << dp.back() + sum << "\n";
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}