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

void debug_out() {cerr << endl;}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T)
{
    cerr << " " << H;
    debug_out(T...);
}
#ifndef ONLINE_JUDGE
    #define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
#else
    #define debug(...) 42
#endif

using ll = long long;
const int maxn = 2e4 + 233;
vector<pair<int, int> > G[maxn];
ll dp[100][maxn];
ll best[maxn];
ll tmp[maxn];

vector<tuple<int, int, int> > edge;

int sz[maxn], d[maxn], son[maxn];
int top;
int n, m, c;
vector<int> lst;
int value[maxn];

void dfs1(int u, int fa){
    d[u] = d[fa] + 1;
    sz[u] = 1;
    for(auto [v, w] : G[u]){
        if(v == fa) continue;
        dfs1(v, u);
        value[v] = w;
        sz[u] += sz[v];
        if(sz[v] > sz[son[u]]) son[u] = v;
    }
}


void dfs2(int u, int fa) {
    if(u != 1 && G[u].size() == 1) {
        return;
    }
    int id = top;
    if(son[u]) {
        dfs2(son[u], u);
        for (int i = 0; i <= m; i += 1) {
            tmp[i] = 1e12;
        }
        tmp[0] = best[son[u]] + c;
        for (int i = value[son[u]]; i <= m; i += 1) {
            tmp[i] = min(dp[top][i], dp[top][0] + c) + lst[i - 1] - lst[value[son[u]] - 1];
        }
        memcpy(dp[id], tmp, sizeof(tmp));
    }
    for (auto [v, w] : G[u]) {
        if(v == fa || v == son[u]) continue;
        top += 1;
        dfs2(v, u);
        for (int i = 1; i < w; i += 1) {
            dp[id][i] = 1e12;
        }
        for (int i = w; i <= m; i += 1) {
            dp[id][i] += min(dp[top][i] , dp[top][0] + c) + lst[i - 1] - lst[w - 1];
        }
        dp[id][0] += best[v] + c;
        top -= 1;
    }
    best[u] = dp[id][0] + c; 
    for (int i = value[u]; i <= m; i += 1) {
        best[u] = min(best[u], dp[id][i] + lst[i - 1] - lst[value[u] - 1]);
    }
}

int main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cin >> n >> c;
    for (int i = 1; i < n; i += 1){
        int u, v, w;
        cin >> u >> v >> w;
        edge.emplace_back(u, v, w);
        lst.emplace_back(w);
    }
    sort(lst.begin(), lst.end());
    lst.erase(unique(lst.begin(), lst.end()), lst.end());
    m = lst.size();
    for (auto [u, v, w] : edge) {
        int p = lower_bound(lst.begin(), lst.end(), w) - lst.begin() + 1;
        G[u].emplace_back(v, p);
        G[v].emplace_back(u, p);
    }
    value[1] = 1;
    dfs1(1, 0);
    dfs2(1, 0);
    ll res = 1e15;
    for (int i = 0; i <= m; i += 1) {
        res = min(res, dp[top][i]);
    }
    cout << res << "\n";
    return 0;
}