#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#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],n,m,x,y,cost,flow,t[NMAX];

vector<int> a[NMAX];
queue<int> coada;
queue<int> em;

bool BFS()
{
    for(int i=1;i<=n;i++)
        viz[i] = 0;
    coada = em;
    int fiu,nod;
    coada.push(1);
    viz[1] = 1;

    while(!coada.empty())
    {
        nod = coada.front(); coada.pop();

        if(nod == n){
            return 1;
        }

        for(int i=0;i<a[nod].size();i++)
        {
            fiu = a[nod][i];
            if(viz[fiu] || c[nod][fiu]==f[nod][fiu])
                continue;
            viz[fiu] = 1;
            coada.push(fiu);
            t[fiu] = nod;
        }
    }
    return 0;
}

void Flow()
{
    int fmin,nod;

    for(flow=0;BFS();)
    {
        for(int i=0;i<a[n].size();i++)
        {
            nod = a[n][i];
            if(!viz[nod] || c[nod][n] == f[nod][n])
                continue;

            t[n] = nod;
            fmin = INF;

            for(int r=n;r!=1;r = t[r])
            {
                fmin = min(fmin,c[t[r]][r]-f[t[r]][r]);
            }

            for(int r=n;r!=1;r=t[r])
            {
                f[t[r]][r] += fmin;
                f[r][t[r]] -= fmin;
            }
            flow = flow + fmin;
        }
    }
    out << flow;
}

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

    Flow();

    return 0;
}