/* 
 * 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 C[Nmax][Nmax];
int cmin[Nmax], f[Nmax];
vector< int > G[Nmax];
vector< int >::const_iterator it, iend;
inline int find_path( void )
{
    int x, i, j;
    queue< int > Q;
    fill( f+2, f+N+1, -1 );
    f[1]=0;
    cmin[1]=oo;
    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;
                cmin[*it]=min( cmin[x], C[x][*it] );
                Q.push(*it);
            }
    }
    if( -1 == f[N] )
        return 0;
    for( j=0, i=1; i <= N; ++i )
        if( C[i][N] > 0 )
        {
            ++j;
            C[i][N]-=cmin[N];
            C[N][i]+=cmin[N];
            for( x=i; f[x]; x=f[x] )
            {
                C[f[x]][x]-=cmin[N];
                C[x][f[x]]+=cmin[N];
            }
        }
    return j*cmin[N];
}
int main( void )
{
    int M, x, y;
    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);
    }
    for( x=0, y=find_path(); y; x+=y, y=find_path() );
    ofstream out( "maxflow.out" );
    out<<x<<'\n';
    return EXIT_SUCCESS;
}