/* 
 * File:   main.cpp
 * Author: SpeeDemon
 *
 * Created on April 7, 2010, 9:33 AM
 */
#include <queue>
#include <cstdlib>
#include <fstream>
#define Nmax 1000
#define oo 0x3f3f3f3f

/*
 * 
 */
using namespace std;
int N;
int C[Nmax][Nmax];
vector< vector< int > > G;
vector< int >::const_iterator it, iend;
inline int find_path( void )
{
    int x;
    queue< int > Q;
    vector< int > f( N, -1 ), fluxm( N );
    f[0]=0;
    fluxm[0]=oo;
    for( Q.push(0); -1 == f[N-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;
                fluxm[*it]=min( fluxm[x], C[x][*it] );
                Q.push(*it);
            }
    }
    if( -1 == f[N-1] )
        return 0;
    f[0]=-1;
    for( x=N-1; -1 != f[x]; x=f[x] )
    {
        C[f[x]][x]-=fluxm[N-1];
        C[x][f[x]]+=fluxm[N-1];
    }
    return fluxm[N-1];
}
inline int MaxFlow( void )
{
    int s=0, p;
    for( p=find_path(); p; s+=p, p=find_path() );
    return s;        
}
int main(int argc, char** argv)
{
    int M, x, y;
    ifstream in( "maxflow.in" );
    in>>N>>M;
    G.resize(N);
    for( ; M; --M )
    {
        in>>x>>y;
        --x,--y;
        in>>C[x][y];
        G[x].push_back(y);
        G[y].push_back(x);
    }
    ofstream out( "maxflow.out" );
    out<<MaxFlow()<<'\n';
    return (EXIT_SUCCESS);
}