#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
#define nodv g[nod][i]
using namespace std;

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

int n, m;
vector<bool> ok;
vector<int> t;
vector<vector<int> > g, c;

void Read();
bool Bfs();

int main()
{
    Read();
    int fmin, answ = 0, nod = n;
    t = vector<int>(n + 1);
    ok = vector<bool>(n + 1);
    while ( Bfs() )
        for ( size_t i = 0; i < g[nod].size(); ++i )
        {
            if ( !ok[nodv] || c[nodv][nod] <= 0 )
                continue;
            t[n] = nodv;
            fmin = INF;
            for ( int x = n; x != 1; x = t[x] )
                fmin = min(fmin, c[t[x]][x]);
            if ( fmin )
            {
                for ( int x = n; x != 1; x = t[x] )
                {
                    c[t[x]][x] -= fmin;
                    c[x][t[x]] += fmin;
                }
                answ += fmin;
            }
        }
    os << answ;
    is.close();
    os.close();
    return 0;
}

bool Bfs()
{
    ok.assign(n + 1, 0);
    t.assign(n + 1, 0);
    int nod;
    queue<int> q;
    q.push(1);
    ok[1] = 1;
    while ( !q.empty() )
    {
        nod = q.front();
        q.pop();
        if ( nod == n )
            continue;
        for ( size_t i = 0; i < g[nod].size(); ++i )
            if ( !ok[nodv] && c[nod][nodv] > 0 )
            {
                ok[nodv] = 1;
                q.push(nodv);
                t[nodv] = nod;
            }
    }
    return ok[n];
}

void Read()
{
    is >> n >> m;
    g = vector<vector<int> >(n + 1);
    c = vector<vector<int> >(n + 1, vector<int>(n + 1));
    int n1, n2;
    while ( m-- )
    {
        is >> n1 >> n2;
        g[n1].push_back(n2);
        g[n2].push_back(n1);
        is >> c[n1][n2];
    }
}