#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
#include <string.h>
using namespace std;

#define INF 0x3f3f3f3f

int c[1005][1005];
int f[1005][1005], t[1005];
vector<int> gr[1005];
int n, m, viz[1005];
queue<int> q;

int bfs()
{
    q.push(1);
    viz[1] = 1;
    memset(viz, 0, sizeof(viz));
    while(!q.empty())
    {
        int node = q.front();
        if(node == n)
            continue;
        q.pop();
        for(auto v: gr[node])
        {
            if(c[node][v] == f[node][v] || viz[v])
                continue;
            viz[v] = 1;
            q.push(v);
            t[v] = node;
        }
    }
    return viz[n];
}

int main()
{
    ifstream fin("maxflow.in");
    ofstream fout("maxflow.out");
    int x, y, z;
    fin>>n>>m;
    for(int i=0; i<m; i++)
    {
        fin>>x>>y>>z;
        c[x][y] = z;
        gr[x].push_back(y);
        gr[y].push_back(x);
    }
    int fmin, flow = 0;
    while(bfs())
    {
        for(int i = 0; i < gr[n].size(); i++)
        {
            int v = gr[n][i];
            if(f[v][n] == c[v][n] || !viz[n])
                continue;
            t[n] = v;
            fmin = INF;
            int node;
            for(node = n; node != 1; node = t[node])
                fmin = min(fmin, c[t[node]][node] - f[t[node]][node]);
            if(fmin == 0)
                continue;
            for(node = n; node != 1; node = t[node])
            {
                f[t[node]][node] += fmin;
                f[node][t[node]] -= fmin;
            }
            flow += fmin;
        }
    }
    fout<<flow;
    return 0;
}