#include <cstdio>
#include <vector>
#include <cstring>
#define NMax 1000
using namespace std;

vector<int> a[NMax+1];
int f[NMax+1][NMax+1];
int c[NMax+1][NMax+1];
int COADA[NMax+1];
int t[NMax+1];
int N,M;

int BFS()
{
    int i,x,y,inc,sf;

    memset(t,0,sizeof(t));
    inc = sf = 0;
    COADA[0] = 1;
    while(inc <= sf)
    {
        x = COADA[inc++];
        for(i = 0; i < a[x].size(); ++i)
        {
            y = a[x][i];
            if(f[x][y] < c[x][y] && !t[y])
            {
                COADA[++sf] = y;
                t[y] = x;
            }
        }
    }

    if(t[N]) return 1;
    return 0;
}

int main(){
    FILE* fin = fopen("maxflow.in","r");
    FILE* fout = fopen("maxflow.out","w");

    int i,j,x,y,z,r,flux;

    fscanf(fin,"%d %d",&N,&M);
    for(i = 1; i <= M; ++i)
    {
        fscanf(fin,"%d %d %d",&x,&y,&z);
        a[x].push_back(y);
        a[y].push_back(x);
        c[x][y] = z;
    }

    for(flux = 0; BFS(); )
        for(i = 0; i < a[N].size(); ++i)
        {
            x = a[N][i];
            if(!t[x] || c[x][N] == f[x][N]) continue;

            r = c[x][N] - f[x][N];
            for(j = x; j > 1; j = t[j]) r = min(r, c[ t[j] ][j] - f[ t[j] ][j]);
            if(!r) continue;

            flux += r;
            f[x][N] += r;
            f[N][x] -= r;
            for(j = x; j > 1; j = t[j])
            {
                f[ t[j] ][j] += r;
                f[j][ t[j] ] -= r;
            }
        }

    fprintf(fout,"%d\n",flux);


return 0;
}