#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <queue>
#include <list>
//#include <windows.h>
//#include <conio.h>
#include <cstdlib>
#include <time.h>
#include <limits.h>
#include <string>
#include <math.h>
using namespace std;
#define forA(V,it) for (typeof(V.begin()) it=V.begin();it!=V.end();it++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define ull unsigned ll
#define MOD 1000000007
#define INF (1<<31)-1
#define MINF -(1<<31)
#define vi vector <int>
#define vll vector <ll>
#define pii pair <int,int>
#define pll pair <ll,ll>
#define newl printf("\n")
#define DIM 100005
int C[1005][1005],F[1005][1005],TT[1005],N,M,Q[1005];
bool used[1005];
vi G[1005];
bool BFS()
{
    memset(used,false,sizeof(used));
    Q[0]=Q[1]=1;
    used[1]=true;
    for (int i=1;i<=Q[0];i++)
    {
        int nod=Q[i];
        if (nod==N) continue;
        for (vi::iterator it=G[nod].begin();it!=G[nod].end();it++)
        {
            if (C[nod][*it]==F[nod][*it] || used[*it]) continue;
            used[*it]=true;
            TT[*it]=nod;
            Q[++Q[0]]=*it;
        }
    }
    return used[N];
}
int main()
{
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
    scanf("%d %d",&N,&M);
    while (M--)
    {
        int x,y,z;
        scanf("%d %d %d",&x,&y,&z);
        C[x][y]+=z;
        G[x].pb(y);
        G[y].pb(x);
    }
    int flow=0;
    while (BFS())
    {
        for (vi::iterator it=G[N].begin();it!=G[N].end();it++)
        {
            if (C[*it][N]==F[*it][N] || !used[*it]) continue;
            TT[N]=*it;
            int fmin=INF;
            for (int i=N;i!=1;i=TT[i])
                fmin=min(fmin,C[TT[i]][i]-F[TT[i]][i]);
            if (fmin==0) continue;
            for (int i=N;i!=1;i=TT[i])
            {
                F[TT[i]][i]+=fmin;
                F[i][TT[i]]-=fmin;
            }
            flow+=fmin;
        }
    }
    printf("%d",flow);
    return 0;
}