#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define NMAX 1003
#define INF 510000
using namespace std;

ifstream in("maxflow.in");
ofstream out("maxflow.out");

int c[NMAX][NMAX],f[NMAX][NMAX],viz[NMAX],cd[NMAX],tt[NMAX],fmin;

vector<int> a[NMAX];

int n,m,x,y,cost,flow;

void citire()
{
    in >> n >> m;
    for(int i=0;i<m;i++)
    {
        in >> x >> y >> cost;
        c[x][y] += cost;
        a[x].push_back(y);
        a[y].push_back(x);
    }
}

int BFS()
{
    int nod,fiu;

    for(int i=1;i<=n;i++)
        viz[i]=0;

    cd[0]= cd[1] = 1;
    viz[1]=1;

    for(int i=1;i<=cd[0];i++)
    {
        nod =cd[i];
        for(int j=0;j<a[nod].size();j++)
        {
            fiu = a[nod][j];

            if(c[nod][fiu]==f[nod][fiu] || viz[fiu]==1) continue;

            viz[fiu] = 1;
            cd [ ++cd[0] ] = fiu;
            tt[fiu] = nod;
            if(fiu == n) return 1;
        }
    }
    return 0;
}

void Flow()
{
    for(flow = 0 ; BFS(); flow = flow + fmin)
    {
        fmin = INF;
        for(int nod = n; nod!=1; nod = tt[nod])
        {
            fmin = min(fmin,c[tt[nod]][nod]-f[tt[nod]][nod]);
        }

        for(int nod = n;nod!=1;nod = tt[nod])
        {
            f[tt[nod]][nod] = f[tt[nod]][nod] + fmin;
            f[nod][tt[nod]] = f[nod][tt[nod]] - fmin;
        }
    }
}

int main()
{
    citire();
    Flow();
    out << flow;
    return 0;
}