#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define inf 1<<30
#define Nmax 1005
using namespace std;

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

int n, viz[Nmax], nod, pr[Nmax], m,c[Nmax][Nmax], f[Nmax][Nmax], fmin, flow, t, x, y, z;
vector<int>v[Nmax];
queue<int>q;
int ok()
{
    for(int i = 1; i <= n; i++)viz[i] = 0;
    viz[1] = 1;
    q.push(1);
    while(!q.empty())
    {
        nod = q.front();
        q.pop();
        if(nod == n)continue;
        for(int i = 0 ; i < v[nod].size(); i++)
        {
            int fiu = v[nod][i];
            if(!viz[fiu])
            {
                if(f[nod][fiu] == c[nod][fiu])continue;
                q.push(fiu);
                pr[fiu] = nod;
                viz[fiu] = 1;
            }
        }
    }
    return viz[n];
}
int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y >> z;
        v[x].push_back(y);
        v[y].push_back(x);
        c[x][y] = z;
    }

    while(ok())
    {
        for(int i = 0; i < v[n].size(); i++)
        {
            pr[n] = v[n][i];
            fmin = inf;
            t = n;
            while(t != 1)
            {
                fmin = min(fmin, c[pr[t]][t] - f[pr[t]][t]);
                t = pr[t];
            }
            t = n;
            while(t != 1)
            {
                f[pr[t]][t] += fmin;
                f[t][pr[t]] -= fmin;
                t = pr[t];
            }
            flow += fmin;
        }
    }
    fout << flow;
    return 0;
}