#include<stdio.h>
#include<stdlib.h>
#include<vector>
#define FIN "maxflow.in"
#define FOUT "maxflow.out"
#define NMAX 1001
#define MMAX 5001
#define INF 0x3f3f3f3f

using namespace std;

vector< int > G[NMAX];
int N,M,c,x,y,viz[NMAX],coada[NMAX],F[NMAX][NMAX],RT[NMAX],fmax,fmin,C[NMAX][NMAX],flux;

int BF()
{
    memset(viz,0,sizeof(viz));
    int p,q;
    coada[p = q = 1] = 1;
    viz[1] = 1;
    while( p <= q )
     {
            int nod = coada[p++];
            if (nod == N) continue;
            vector< int >::iterator it;
            for(it = G[nod].begin() ; it != G[nod].end() ; it++)
             {
                 if( F[nod][ *it ] == C[nod][ *it ] || viz[ *it ]) continue;
                 viz [ *it ] = 1;
                 RT[ *it ]=nod;
                 coada[ ++q ] = *it;
                   
            }
    }
    
    return viz[ N ];
    }


int main()
{
    freopen(FIN,"r",stdin);
    freopen(FOUT,"w",stdout);
    scanf("%d %d\n",&N,&M);
    for(int i = 1 ; i <= M ; i++)
      {
            scanf("%d %d %d",&x,&y,&c);
            C[x][y] = c;
            G[x].push_back(y);
            G[y].push_back(x);
        }
      for( ; BF() ; )
      {
          vector< int >::iterator i;  
          for( i = G[N].begin() ; i!=G[N].end(); i++ )
           {
                if(F[ *i ][N] == C[ *i ][N] || !viz[ *i ]) continue;
                RT [ N ] = *i ;
                fmin = INF;
               for( int nod = N ;nod != 1 ; nod = RT[nod])
                {
                    fmin = min (fmin , C[ RT[nod] ][ nod ] - F[ RT[nod] ][ nod ]);
                }
                if(fmin == 0) continue;
                for( int nod =  N ;nod!=1 ; nod=RT[nod])
                 {
                    F[RT[nod]][nod] += fmin;
                    F[nod][RT[nod]] -=fmin;     
                }
                 flux += fmin;
           }  
          
        }  
       printf("%d",flux); 
     
     return 0;   
    }