#include<iostream>#include<cstdio>#include<cstring>using namespace std;#define MAX 123456789struct node{int value,lChild,rChild;};node nVert[101];struct Adta{int i,value,next;};Adta mVert[202];int res[101][101],head[101],visit[101],inum[101],N,n,m;int add(int s,int t,int w){    mVert[N].i=t;    mVert[N].value=w;    mVert[N].next=head[s];    head[s]=N;return N++;}int init(int i)//利用构造好的临界表重新建树{int j;    visit[i]=1;    nVert[i].lChild=nVert[i].rChild=0;for(j=head[i];j;j=mVert[j].next)if(!visit[mVert[j].i])        {if(nVert[i].lChild==0)             {                nVert[i].lChild=mVert[j].i;                nVert[mVert[j].i].value=mVert[j].value;                init(mVert[j].i);            }else if(nVert[i].rChild==0)            {                nVert[i].rChild=mVert[j].i;                nVert[mVert[j].i].value=mVert[j].value;                init(mVert[j].i);            }        }return 1;}int max(int a,int b){return a > b ? a : b;}int dfs(int i){int j,lc,rc,l;    lc=nVert[i].lChild;    rc=nVert[i].rChild;if(!lc && !lc)    {        res[i][0]=nVert[i].value;return res[i][1];    }if(lc) dfs(lc);if(rc) dfs(rc);for(j=0;j<n-m && j<=inum[i];j++)    {for(l=0;l<=j;l++)if(l<=inum[lc]+1 && j-l<=inum[rc]+1) res[i][j]=max(res[i][j],res[lc][l]+res[rc][j-l]+nVert[i].value);    }return res[i][n-m-1];}int GetInum(int i)//获取以i为根的子树的树枝数{if(!nVert[i].lChild && !nVert[i].rChild)    {return 0;    }if(nVert[i].lChild)        inum[i]+=GetInum(nVert[i].lChild)+1;if(nVert[i].rChild)        inum[i]+=GetInum(nVert[i].rChild)+1;return inum[i];}int main(){int i,s,t,w;while(scanf("%d %d",&n,&m)!=EOF)    {        N=1;        memset(head,0,sizeof(head));        memset(visit,0,sizeof(visit));        memset(res,0,sizeof(res));        memset(inum,0,sizeof(inum));for(i=1;i<n;i++)        {            scanf("%d %d %d",&s,&t,&w);            head[s]=add(s,t,w);            head[t]=add(t,s,w);        } inum[0]=-1;        init(1);        GetInum(1);        printf("%d\n",dfs(1));    }return 0;}