#include <fstream>
#include <vector>
#include <algorithm>
#include <bitset>
#define NMAX 1002
#define MMAX 5002
#define INF 0x3f3f3f3f

using namespace std;

ifstream f("maxflow.in");
ofstream o("maxflow.out");

int n,m;
int flux[NMAX][NMAX], cap[NMAX][NMAX];
vector <int> g[NMAX];
bitset <NMAX> viz;

void input()
{
    f >> n >> m;
    int x,y,c;
    for(int i = 1; i <= m; ++i)
    {
        f >> x >> y >> c;
        g[x].push_back(y);
        g[y].push_back(x);
        cap[x][y] = c;
    }
}

bool ok;
int minimum;

void dfs(int nod)
{
    if(nod == n)
    {
        ok = true;
        return;
    }
    viz[nod] = true;
    for(vector<int>::iterator it = g[nod].begin(); it != g[nod].end(); ++it)
        if(cap[nod][*it] > flux[nod][*it] && viz[*it] == false)
        {
            int hahaha = *it;
            int aux_minimum = minimum;
            minimum = min(minimum, cap[nod][*it] - flux[nod][*it]);
            dfs(*it);
            if(ok)
            {
                flux[*it][nod] -= minimum;
                flux[nod][*it] += minimum;
                viz[nod] = false;
                return;
            }
            minimum = aux_minimum;
        }
    viz[nod] = false;
}

void calc_flow()
{
    ok = true;
    while(ok)
    {
        minimum = INF;
        ok = false;
        dfs(1);
    }
}

void output_flow()
{
    int total = 0;

    for(vector<int>::iterator it = g[1].begin(); it != g[1].end(); ++it)
        total += flux[1][*it];

    o << total << '\n';
}

int main()
{
    input();
    calc_flow();
    output_flow();
    return 0;
}