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

using namespace std;

#define Nmax 1003
#define INF 0x3f3f3f3f

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

int N, M;

void read()
{
    ifstream f("maxflow.in");

    f >> N >> M;

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

        C[a][b] = c;
        C[b][a] = c;

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

    f.close();
}

inline bool BFS( int source, int destination )
{
    memset( viz, 0, sizeof( viz ) );

    int st, dr;

    coada[st = dr = 1] = source;
    viz[source] = 1;

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

        for ( unsigned i = 0; i < G[nod].size(); ++i )
        {
            int vertex = G[nod][i];

            if ( !viz[vertex] && C[nod][vertex] > F[nod][vertex] )
            {
                tata[vertex] = nod;
                viz[vertex] = 1;

                coada[ ++dr ] = vertex;

                if ( vertex == destination )
                        return true;
            }
        }
    }

    return false;
}

int Edmonds_Karp( int source, int destination )
{
    int flow = 0, fmin, nod;

    while( BFS( source, destination ) )
    {
        for ( unsigned i = 0; i < G[destination].size(); ++i )
        {
            int son = G[destination][i];

            if ( !viz[son] || F[son][destination] >= C[son][destination] )
                    continue;

            fmin = INF;
            tata[destination] = son;

            for ( nod = destination; nod != source; nod = tata[nod] )
                    fmin = min( fmin, C[ tata[nod] ][nod] - F[ tata[nod] ][nod] );

            if ( !fmin )
                    continue;

            for ( nod = destination; nod != source; nod = tata[nod] )
            {
                F[ tata[nod] ][nod] += fmin;
                F[nod][ tata[nod] ] -= fmin;
            }

            flow += fmin;
        }
    }

    return flow;
}

int dinic(int source, int destination)
{
    int flow=0;
    int i, fmin,j, nod;

    while(BFS(source, destination))
    {

        for( j = source; j < destination; ++j )
            if( C[j][destination] - F[j][destination] > 0 )
            {
                fmin = INF;

                for ( nod = destination; nod != source; nod = tata[nod] )
                    fmin = min( fmin, C[ tata[nod] ][nod] - F[ tata[nod] ][nod] );

            if ( !fmin )
                    continue;

            for ( nod = destination; nod != source; nod = tata[nod] )
            {
                F[ tata[nod] ][nod] += fmin;
                F[nod][ tata[nod] ] -= fmin;
            }

            flow += fmin;
            }
    }
     return flow;
}

void print()
{
    ofstream g("maxflow.out");

    g << dinic( 1, N ) << "\n";

    g.close();
}

int main()
{
    read();
    print();

    return 0;
}