#include<stdio.h>

 #include<string.h>

 #include<vector>

 #define maxn 222

 #define inf 0x3f3f3f3f

 using namespace std;

 struct edge{

     int to;

     int cap;

     int rev;

 };

 vector<edge>e[maxn];

 int book[maxn];

 int dfs(int cur,int end,int flow){

     if(cur == end)

         return flow;

     book[cur] = ;

     for(int i = ;i<e[cur].size();i++){

         edge &temp = e[cur][i];

         if(!book[temp.to] && temp.cap>){

             int d = dfs(temp.to,end,min(flow,temp.cap));

             if(d > ){

                 temp.cap -= d;

                 e[temp.to][temp.rev].cap += d;

                 return d;

             }

         }

     }

     return ;

 }

 int main(){

     int n,m;

     while(scanf("%d%d",&n,&m)!=EOF){

         for(int i = ;i<=n;i++)

             e[i].clear();

         int u,v,w;

         for(int i = ;i<n;i++){

             scanf("%d%d%d",&u,&v,&w);

             e[u].push_back((edge){v,w,e[v].size()});

             e[v].push_back((edge){u,,e[u].size()-});

         }

         int ans = ;

         while(){

             memset(book,,sizeof(book));

             int temp = dfs(,m,inf);

             if(temp == )

                 break;

             ans += temp;

         }

         printf("%d\n",ans);

     }

     return ;

 }