#include <bits/stdc++.h>

using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int tata[1005],cap[1005][1005],flux[1005][1005],n;
vector <int> v[1005];
bool ok(int x)
{
    for (int i=1;i<=n;i++)
    {
        tata[i]=-1;
    }
    tata[x]=0;
    queue <int >q;
    q.push(x);
    while (!q.empty())
    {
        int acum;
        acum=q.front();
        q.pop();
        for (int i=0;i<v[acum].size();i++)
        {
            int nod=v[acum][i];
            if (tata[nod]==-1&&cap[acum][nod]!=flux[acum][nod])
            {
                tata[nod]=acum;
                q.push(nod);
                if (nod==n)
                {
                    return 1;
                }
            }
        }
    }
    return 0;
}
int m,i,x,y,limita;
int main()
{
    f>>n>>m;
    for (i=1;i<=m;i++)
    {
        f>>x>>y>>limita;
        cap[x][y]=limita;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    int ceau,sol=0;
    while (ok(1))
    {
        for (int i=0;i<v[n].size();i++)
        {
            if (tata[v[n][i]]==-1)
            {
                continue;
            }
            int nod=v[n][i];
            ceau=cap[nod][n]-flux[nod][n];
            while (tata[nod]!=0)
            {
                ceau=min(ceau,cap[tata[nod]][nod]-flux[tata[nod]][nod]);
                nod=tata[nod];
            }
            sol+=ceau;
            nod=v[n][i];
            flux[nod][n]+=ceau;
            flux[n][nod]-=ceau;
            while (tata[nod]!=0)
            {
                flux[tata[nod]][nod]+=ceau;
                flux[nod][tata[nod]]-=ceau;
                nod=tata[nod];
            }
        }
    }
    g<<sol;
    return 0;
}