/* 
 * File:   main.cpp
 * Author: virtualdemon
 *
 * Created on May 15, 2010, 7:15 PM
 */
#include <queue>
#include <cstdlib>
#include <fstream>
#include <algorithm>
#define Nmax 1011
#define oo 0x3f3f3f3f

/*
 * 
 */
using namespace std;
int N;
int f[Nmax];
int C[Nmax][Nmax];
vector< int > G[Nmax];
vector< int >::const_iterator it, iend;
inline bool find_path( void )
{
    int x;
    queue< int > Q;
    fill( f+1, f+N+1, -1 );
    f[1]=0;
    for( Q.push(1); !Q.empty(); )
    {
        x=Q.front(); Q.pop();
        for( it=G[x].begin(), iend=G[x].end(); it < iend; ++it )
            if( -1 == f[*it] && C[x][*it] > 0 )
            {
                f[*it]=x;
                Q.push(*it);
            }
    }
    return -1 != f[N];
}
int main( void )
{
    int M, x, y, c, flow=0;
    ifstream in( "maxflow.in" );
    for( in>>N>>M; M; --M )
    {
        in>>x>>y;
        in>>C[x][y];
        G[x].push_back(y);
        G[y].push_back(x);
    }
    while( find_path() )
    {
        for( M=1; M < N; ++M )
            if( C[M][N] > 0 )
            {
                c=C[M][N];
                for( y=M; f[y]; y=f[y] )
                    if( c > C[f[y]][y] )
                        c=C[f[y]][y];
                flow+=c;
                C[M][N]-=c;
                C[N][M]+=c;
                for( y=M; f[y]; y=f[y] )
                {
                    C[f[y]][y]-=c;
                    C[y][f[y]]+=c;
                }
            }
    }
    ofstream out( "maxflow.out" );
    out<<flow<<'\n';
}