#include <queue>
#include <cstdlib>
#include <fstream>
#include <algorithm>
#define Nmax 1111
#define oo 9999999

/*
 *
 */
using namespace std;
queue< int > Q;
int N;
int c[Nmax], f[Nmax];
int C[Nmax][Nmax], F[Nmax][Nmax];
inline bool BFS( void )
{
    int x, i;
    fill( f+2, f+N+1, -1 );
    f[1]=0;
    c[1]=oo;
    for( Q.push(1); !Q.empty(); )
    {
        x=Q.front(); Q.pop();
        for( i=1; i <= N; ++i )
            if( -1 == f[i] && C[x][i] > F[x][i] )
            {
                f[i]=x;
                c[i]=min( c[x], C[x][i]-F[x][i] );
                Q.push( i );
            }
    }
    return -1 != f[N];
}
int main( void )
{
    int M, x, y, s;
    ifstream in( "maxflow.in" );
    for( in>>N>>M; M; --M )
    {
        in>>x>>y;
        in>>C[x][y];
    }
    for( s=0; BFS(); )
    {
        for( x=1; x <= N; ++x )
            if( C[x][N] > F[x][N] )
            {
                c[x]=min( c[x], C[x][N]-F[x][N] );
                s+=c[x];
                F[x][N]+=c[x];
                F[N][x]-=c[x];
                for( y=x; f[y]; y=f[y] )
                {
                    F[f[y]][y]+=c[x];
                    F[y][f[y]]-=c[x];
                }
            }
    }
    ofstream out( "maxflow.out" );
    out<<s<<'\n';
    return EXIT_SUCCESS;
}