#include <iostream>
#include <cstring>
#include <fstream>
#define inf 1000000;
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int c[1001][1001],F[1001][1001],T[1001],flux,n,m,x,y,z,s,d;

int BFS(int s,int d)
{
    int p,u,nod,Q[1001];
    memset(T,0,sizeof(T));
    p=u=1;
    Q[p]=s;
    T[s]=-1;
    while(p<=u)
    {
        nod=Q[p];
        for(int i=1; i<=n; i++)
            if(T[i]==0&&c[nod][i]>F[nod][i])
            {
                Q[++u]=i;
                T[i]=nod;
                if(i==d)
                return i;
            }
        p++;

    }
    return 0;

}


void flux_maxim()
{
    int r,i,j;
    s=1;
    d=n;
    for(flux=0; BFS(s,d);)
    {
        for(int i=1; i<=n; i++)
            {if(T[i]==0||c[i][d]<=F[i][d])
                continue;
        r=c[i][d]-F[i][d];
        for(j=i; j!=s&&j; j=T[j])
            r=min(r,c[T[j]][j]-F[T[j]][j]);
        if(r==0)continue;
        F[i][d]+=r;
        F[d][i]-=r;
        for(j=i; j!=s; j=T[j])
        {
            F[T[j]][j]+=r;
            F[j][T[j]]-=r;
        }
        flux+=r;

    }
    }
    g<<flux;
}

int main()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
        f>>x>>y>>z,c[x][y]=z;
    s=1;
    d=n;
    flux_maxim();



    return 0;
}