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

typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> Pair;
typedef tuple<int,int,int> tpl;

#define ALL(a)  (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define EXIST(m,v) (m).find((v)) != (m).end()
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)

#define en "\n"

constexpr double EPS = 1e-9;
constexpr double PI  = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL<<60;
constexpr long long MOD = 1000000007; // 998244353;

template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}

ll ans = 0;
int k;
vector<vector<Pair>> edge;
VI vis,n_leaves;
VL dp;

void dfs(int v){
    vis[v] = 1;

    int flag = 1;
    for(auto [to,cost] : edge[v]){
        if(vis[to]) continue;
        dfs(to);
        ans += 1LL*cost*n_leaves[to];
        RREP(i,k){
            if(dp[i]<0) continue;
            chmax(dp[i + cost], dp[i] + 1LL*cost*n_leaves[to]);
        }
        flag = 0;
        n_leaves[v] += n_leaves[to];
    }
    n_leaves[v] += flag;

    return;
}


void Main(){
    int n; cin >> n >> k;
    edge.resize(n); vis.resize(n,0); n_leaves.resize(n,0); dp.resize(3*k,-LINF); dp[0] = 0;
    REP(i,n-1){
        int a,b,c; cin >> a >> b >> c; a--; b--;
        edge[a].emplace_back(b,c); edge[b].emplace_back(a,c);
    }

    dfs(0);

    ll mx = 0; REP(i,k) chmax(mx,dp[i+1]);
    ans += mx;
    cout << ans << en;
    return;
}

int main(void){
    cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<<fixed<<setprecision(15);
    int t=1; //cin>>t;
    while(t--) Main();
    return 0;
}