#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(long i=a;i<b;i++)
#define pb push_back
#define ll long long
#define pob pop_back
#define si second
#define fi first
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0) 
 
int dp[1000][1000];
vector<pair<int,int>> adj[1000];
int n,K;

int dfs(int node,int pa,int k){

//cout<<node<<" "<<pa<<" "<<k<<" "<<dp[node][k]<<"\n";
if(dp[node][k]!=-1){ return dp[node][k];}


int ans=-99999999; int ch=0;
	for(auto u:adj[node]){ 
	if(u.fi!=pa){ ch++;
		if(k<K){ 
		int d1=u.si+dfs(u.fi,node,k); //cout<<d1<<" d1 "<<u.fi<<" "<<node<<"\n";
		int d2=-u.si+dfs(u.fi,node,k+1); //cout<<d2<<" d2 "<<u.fi<<" "<<node<<"\n";
		ans=max(ans,max(d1,d2  ));}
		else{ ans=max(ans,u.si+dfs(u.fi,node,k)); //cout<<ans<<" a "<<u.fi<<" "<<node<<"\n"; 
		}
	}

	}
if(ch==0){ ans=0;}
dp[node][k]=ans;
//cout<<"dp "<<dp[node][k]<<"\n";
return ans;
}

//================================================//

int main(){
fastio;
 cin>>n>>K;
int a,b,k; 
FOR(i,0,n-1){ cin>>a>>b>>k; adj[a].pb({b,k}); adj[b].pb({a,k}); }

int ans=-99999999;
FOR(i,1,n+1){ memset(dp,-1,sizeof(dp)); ans=max(ans,dfs(i,-1,0)); }
cout<<ans<<"\n";

return 0;}

6 2
1 2 2
2 5 -1
2 6 -3
1 4 -5
4 3 6
ans->16

6 1
1 2 2
2 5 -1
2 6 -3
1 4 -5
4 3 6
ans->13