#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>

using namespace std;

const int Nmax = 1005;
const int inf = 1e9;

vector <int> G[Nmax];
int C[Nmax][Nmax], F[Nmax][Nmax];
int coada[Nmax], tata[Nmax], vis[Nmax];

int N, M;

bool BFS( int S, int D )
{
    memset( vis, 0, sizeof( vis ) );

    int st, dr;

    vis[S] = 1;
    tata[S] = 0;
    coada[ st = dr = 1 ] = S;

    while ( st <= dr )
    {
        int nod = coada[ st++ ];

        for ( auto vecin: G[nod] )
        {
            if ( !vis[vecin] && C[nod][vecin] > F[nod][vecin] )
            {
                vis[vecin] = 1;
                tata[vecin] = nod;
                coada[ ++dr ] = vecin;

                if ( vecin == D )
                        return 1;
            }
        }
    }

    return 0;
}

int Edmonds_Karp( int S, int D )
{
    int flow = 0, fmin;

    while ( BFS( S, D ) )
    {
        for ( auto vecin: G[D] )
        {
            if ( !vis[vecin] || F[vecin][D] >= C[vecin][D] ) continue;

            tata[D] = vecin;
            fmin = inf;

            for ( int nod = D; nod != S; nod = tata[nod] )
                    fmin = min( fmin, C[ tata[nod] ][nod] - F[ tata[nod] ][nod] );

            for ( int nod = D; nod != S; nod = tata[nod] )
            {
                F[ tata[nod] ][nod] += fmin;
                F[nod][ tata[nod] ] -= fmin;
            }

            flow += fmin;
        }
    }

    return flow;
}

int main()
{
    ifstream f("maxflow.in");
    ofstream g("maxflow.out");

    f >> N >> M;

    for ( int i = 1, a, b, c; i <= M; ++i )
    {
        f >> a >> b >> c;

        G[a].push_back( b );
        G[b].push_back( a );

        C[a][b] = c;
    }

    g << Edmonds_Karp( 1, N );

    return 0;
}