#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
using namespace std;

ifstream is("maxflow.in");
ofstream os("maxflow.out");

using VB = vector<bool>;
using VI = vector<int>;
using VVI = vector<VI>;

int n, m;
VB ok;
VI t;
VVI g, c;

void Read();
bool BF();

int main()
{
    Read();
    int answ = 0, fmin;
    while ( BF() )
        for ( const auto& nodv : g[n] )
        {
            if ( !ok[nodv] || c[nodv][n] <= 0 )
                continue;
            t[n] = nodv;
            fmin = INF;
            for ( int i = n; i != 1; i = t[i] )
                fmin = min(fmin, c[t[i]][i]);
            if ( fmin )
            {
                for ( int i = n; i != 1; i = t[i] )
                {
                    c[t[i]][i] -= fmin;
                    c[i][t[i]] += fmin;
                }
                answ += fmin;
            }
        }
    os << answ;
    is.close();
    os.close();
    return 0;
}

bool BF()
{
    ok = VB(n + 1, 0);
    queue<int> q;
    q.push(1);
    ok[1] = true;
    int nod;
    while ( !q.empty() )
    {
        nod = q.front();
        q.pop();
        if ( nod == n )
            continue;
        for ( const auto& nodv : g[nod] )
            if ( !ok[nodv] && c[nod][nodv] > 0 )
            {
                t[nodv] = nod;
                ok[nodv] = 1;
                q.push(nodv);
            }
    }
    return ok[n];
}

void Read()
{
    is >> n >> m;
    t = VI(n + 1);
    g = VVI(n + 1);
    c = VVI(n + 1, VI(n +  1));
    int n1, n2, cost;
    for ( int i = 1; i <= m; ++i )
    {
        is >> n1 >> n2 >> cost;
        g[n1].push_back(n2);
        g[n2].push_back(n1);
        c[n1][n2] = cost;
    }
}