#include<stdio.h>
#include<string.h>
#include<vector>
using namespace std;

#define NMAX 1005
#define minim(a,b) (a<b ? a : b)
#define INF 1000000000
#define pb push_back

int n,m,sol;
int q[NMAX],pred[NMAX];
vector<int> v[NMAX];
int f[NMAX][NMAX];
int cap[NMAX][NMAX];
char viz[NMAX];

int bfs(int start)
{
    int i,inc,sf,nod,lim,x;
    
    memset(viz,0,sizeof(viz));
    memset(q,0,sizeof(q));
    memset(pred,-1,sizeof(pred));
    q[1]=start;
    viz[start]=1;
    inc=1;sf=1;
    while(inc<=sf)
    {
        nod=q[inc];
        lim=v[nod].size();
        for(i=0;i<lim;i++)
            if(!viz[x=v[nod][i]] && f[nod][x]<cap[nod][x])
            {
                q[++sf]=x;
                viz[x]=1;
                pred[x]=nod;
                if (x==n)
                    return 1;
            }
        inc++;
    }
    return 0;
}

int main ()
{
    int i,j,a,b,c,val;
    
    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",&a,&b,&c);
        v[a].pb(b);
        cap[a][b]+=c;
        v[b].pb(a);
    }
    while(bfs(1))
    {
        for(i=1;i<n;i++)
        {
            if (pred[i]==-1)
                continue;
            val=cap[i][n]-f[i][n];
            for(j=i; j!=1 && val>0; j=pred[j])
                val=minim(val,cap[pred[j]][j]-f[pred[j]][j]);
            if (val==0)
                continue;

            f[i][n]+=val; f[n][i]-=val;
            for(j=i;j!=1;j=pred[j])
            {
                f[pred[j]][j]+=val;
                f[j][pred[j]]-=val;
            }
            sol+=val;
        }            
    }

    printf("%d\n", sol);
    
    return 0;
}