#include <bits/stdc++.h>

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