#include <cstdio>
#include <vector>
using namespace std;
vector <int> v[1004];
int n,m,nr,nr1,i,j,k,x,y,z,r,fl,l[1004],viz[1004],t[1004],c[1004][1004],f[1004][1004];
int b ()
{
    l[++nr1]=1;
    viz[1]=nr;
    for (i=1;i<=nr1;i++)
    {
        k=v[l[i]].size();
        for (j=0;j<=(k-1) && l[i]!=n;j++)
        {
            if (viz[v[l[i]][j]]<nr && c[l[i]][v[l[i]][j]]!=f[l[i]][v[l[i]][j]])
            {
                viz[v[l[i]][j]]=nr;
                t[v[l[i]][j]]=l[i];
                l[++nr1]=v[l[i]][j];
            }
        }
    }
    if (viz[n]==nr)
        return 1;
    else
        return 0;
}
int main()
{
    freopen ("flowmax.in","r",stdin);
    freopen ("flowmax.out","w",stdout);
    scanf ("%d %d", &n, &m);
    for (i=1;i<=m;i++)
    {
        scanf ("%d %d %d", &x, &y, &z);
        c[x][y]=z;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    nr=1;
    nr1=0;
    r=0;
    while (b()==1)
    {
        k=v[n].size();
        for (i=0;i<=(k-1);i++)
        {
            if (viz[v[n][i]]==nr && f[v[n][i]][n]!=c[v[n][i]][n])
            {
                fl=2000000000;
                t[n]=v[n][i];
                for (j=n;j!=1;j=t[j])
                    if (fl>(c[t[j]][j]-f[t[j]][j]))
                        fl=c[t[j]][j]-f[t[j]][j];
                for (j=n;j!=1;j=t[j])
                {
                    f[t[j]][j]+=fl;
                    f[j][t[j]]-=fl;
                }
                r+=fl;
            }
        }
        nr++;
        nr1=0;
    }
    printf ("%d\n", r);
    return 0;
}