#include<stdio.h>
#define INF 0x3f3f3f3f
#include<string.h>
#define Nmx 1001

int n,m,viz[Nmx],pre[Nmx];
int r[Nmx][Nmx];
int f[Nmx][Nmx];

struct nod
{
    int inf;
    nod *urm;
};
nod *G[Nmx];

void add(int x,int y)
{
    nod *aux=new nod;
    aux->urm=G[x];
    aux->inf=y;
    G[x]=aux;
}

void citire()
{
    int x,y,c;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;++i)
    {
        scanf("%d%d%d",&x,&y,&c);
        r[x][y]=c;
        add(x,y);
        add(y,x);
    }
}

int BFS()
{
    int q[Nmx],st,dr;
    st=dr=1;
    memset(viz,0,sizeof(viz));
    q[st]=1;
    viz[1]=1;
    while(st<=dr)
    {
        for(nod *p=G[q[st]];p;p=p->urm)
            if(!viz[p->inf]&&r[q[st]][p->inf]!=f[q[st]][p->inf])
            {
                q[++dr]=p->inf;
                viz[p->inf]=1;
                pre[p->inf]=q[st];
                if(p->inf==n)
                    return 1;
            }
        ++st;
    }
    return 0;
}

int min(int a,int b)
{
    if(a<b) return a;
    return b;
}

int main()
{
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
    citire();
    int sol=0,sum=0;
    while(BFS())
    {
        sum=INF;
        int nod;
        for(nod=n;nod!=1;nod=pre[nod])
           sum=min(sum,r[pre[nod]][nod]-f[pre[nod]][nod]);
        for (nod = n; nod != 1; nod = pre[nod])
        {
            f[pre[nod]][nod]+=sum;
            f[nod][pre[nod]]-=sum;
        }
        sol+=sum;
    }
    printf("%d ",sol);
    return 0;
}