#include <bits/stdc++.h>
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int a[1001][1001], flux[1001][1001], n, m;
void cit()
{
    f >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y, k;
        f >> x >> y >> k;
        a[x][y] = k;
        flux[x][y] = k; 
    }
}
vector <int> t(1001, 0);
void dfs(int nod, int tata)
{
    t[nod] = tata;
    for(int i = 1; i <= n; i++)
    {
        if(flux[nod][i] != 0 && t[i] == 0)
            dfs(i, nod);
    }
}
bool areDrum()
{
    fill(t.begin(), t.end(), 0);
    dfs(1, 0);
    if(t[n] != 0)
        return true;
    return false;
}
void rez()
{
    int sum = 0;
    while(areDrum())
    {
        int capmin = INT_MAX;
        for(int i = n; i != 1; i = t[i])
        {
            capmin = min(capmin, flux[t[i]][i]);
        }
        for(int i = n; i != 1; i = t[i])
        {
            flux[t[i]][i] -= capmin;
            flux[i][t[i]] += capmin;
        }
        sum += capmin;
    }
    g << sum;
}
int main()
{
    cit();
    rez();
    return 0;
}