#include<cstdio>
#include<vector>
#define boooooooool bool
#include<cstring>

using namespace std;

vector<int> g[1002];
int fmin,flo,n,m,x,y,z,i,nod,t[1002],c[1002][1002],f[1002][1002],cd[1002];
bool sel[1002];

boooooooool bf()
{
    int i,j,nod,v;
    cd[0]=1;
    cd[1]=1;
    memset(sel,0,sizeof(sel));
    sel[1]=true;
    for(i=1;i<=cd[0];i++)
    {
        nod=cd[i];
        if(nod==n) continue;
        for(j=0;j<g[nod].size();j++)
        {
            v=g[nod][j];
            if(sel[v]||c[nod][v]==f[nod][v]) continue;
            cd[++cd[0]]=v;
            sel[v]=true;
            t[v]=nod;
        }
    }
    return sel[n];
}

int main()
{
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.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;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    while(bf())
    {
        for(i=0;i<g[n].size();i++)
        {
            nod=g[n][i];
            if(f[nod][n]==c[nod][n]||!sel[nod]) continue;
            t[n]=nod;
            fmin=100000000;
            for(nod=n;nod!=1;nod=t[nod])
            {
                fmin=min(fmin,c[t[nod]][nod]-f[t[nod]][nod]);
            }
            if(fmin==0) continue;
            for(nod=n;nod!=1;nod=t[nod])
            {
                f[t[nod]][nod]+=fmin;
                f[nod][t[nod]]-=fmin;
            }
            flo+=fmin;
        }
    }
    printf("%d\n",flo);
}