/**
 * Code by Patrick Sava
 * "Spiru Haret" National College of Bucharest
 **/

# include "fstream"
# include "cstring"
# include "vector"
# include "queue"
# include "bitset"
# include "algorithm"
# include "map"
# include "unordered_map"
# include "deque"
# include "string"
# include "iomanip"
# include "cmath"
# include "stack"
# include "cassert"

const char IN [ ] =  "maxflow.in" ;
const char OUT [ ] = "maxflow.out" ;
const int MAX = 1014 ;

# define pb push_back
# define mp make_pair
# define FORN( a , b , c ) for ( int a = b ; a <= c ; ++ a )
# define FORNBACK( a , b , c ) for ( int a = b ; a >= c ; -- a )

using namespace std ;

ifstream cin ( IN ) ;
ofstream cout ( OUT ) ;

vector < int > gr [ MAX ] ;
int cap [ MAX ] [ MAX ] ;
int flux [ MAX ] [ MAX ] , tata [ MAX ] ;

bitset < MAX > viz ;

queue < int > Q ;

int n ;

inline int bfs ( )
{
    viz.reset ( ) ;
    Q.push ( 1 ) ;

    while ( !Q.empty ( ) )
    {
        int nod = Q.front ( ) ;
        Q.pop ( ) ;
        if ( nod == n ) continue ;
        for ( auto x : gr [ nod ] )
        {
            if ( cap [ nod ] [ x ] == flux [ nod ] [ x ] or viz [ x ] ) continue ;
            Q.push ( x ) ;
            tata [ x ] = nod ;
            viz [ x ] = 1 ;
        }
    }

    return viz [ n ] ;
}

int main ( void )
{
    int m ;
    cin >> n >> m ;
    FORN ( i , 1 , m )
    {
        int x , y , z ;
        cin >> x >> y >> z ;

        gr [ x ].pb ( y ) ;
        gr [ y ].pb ( x ) ;

        cap [ x ] [ y ] += z ;

    }

    int CET = 0 ;

    for ( CET = 0 ; bfs ( ) ; )
    {
        for ( auto x : gr [ n ] )
        {
            if ( cap [ x ] [ n ] == flux [ x ] [ n ] or !viz [ x ] ) continue ;
            tata [ n ] = x ;

            int local = 1 << 30 ;

            for ( int i = n ; i != 1 ; i = tata [ i ] )
            {
                local = min ( local , cap [ tata [ i ] ] [ i ] - flux [ tata [ i ] ] [ i ] ) ;
            }

            if ( local == 0 ) continue ;

            for ( int i = n ; i != 1 ; i = tata [ i ] )
            {
                flux [ tata [ i ] ] [ i ] += local ;
                flux [ i ] [ tata [ i ] ] -= local ;
            }

            CET += local ;
        }
    }

    cout << CET << '\n' ;
    return 0;
}