#include<iostream>
#include<queue>
#include<vector>
using namespace std;
int n,q,in[101],ans;
struct node{
	int to,data;
	bool operator <(const node &x)const{
		return x.data<data;
	}
}fa[101];
vector<node>g1[101],g[101];
priority_queue<node>s;
void dfs(int x,int pre){
	for(int i=0;i<g1[x].size();i++){
		if(g1[x][i].to!=pre){
			fa[g1[x][i].to]=(node){x,g1[x][i].data};
			dfs(g1[x][i].to,x);
		}
	}
}
int main(){
	cin>>n>>q;q=n-1-q;
	for(int i=1;i<n;i++){
		int x,y,z;
		cin>>x>>y>>z;ans+=z;
		g1[x].push_back((node){y,z});
		g1[y].push_back((node){x,z});
	}
	dfs(1,0);in[0]=0x7fffffff;
	for(int i=1;i<=n;i++)in[fa[i].to]++;
	for(int i=1;i<=n;i++)if(!in[i])s.push(fa[i]);
	while(q--){
		node x=s.top();ans-=x.data;s.pop();
			in[fa[x.to].to]--; 
			if(!in[fa[x.to].to])s.push(fa[x.to]);
	}
	cout<<ans;
}