///O(n*m*m)
#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
#define INFINITY 999999999
using namespace std;
int noNodes;
int noEdges;
vector<vector<pair<int, int>>> graf_c;
vector<vector<int>> f;
vector<vector<pair<int, int>>> graf_t;
vector<int> viz;
vector<int> tata;
vector<vector<int>> c;

bool constructSTNesaturatedBF(int s, int t);
void revizFlux(int s, int t, int& ip);
int EndmondsKarp();
void citireFisier();
void testEdmondsKarp();

int main() {
    citireFisier();
    testEdmondsKarp();
    return 0;
}

void citireFisier(){
    int x, y, z;
    ifstream fin("maxflow.in");
    fin>>noNodes>>noEdges;

    graf_c.resize(noNodes+1);
    f.resize(noNodes + 1, vector<int>(noNodes + 1, 0));
    graf_t.resize(noNodes + 1);
    viz.resize(noNodes + 1, 0);
    tata.resize(noNodes + 1, 0);
    c.resize(noNodes + 1, vector<int>(noNodes + 1, 0));
    for(int i = 0; i < noEdges; ++i){
        fin>>x>>y>>z;
        graf_c[x].push_back(make_pair(y, z));
        c[x][y] = z;
        graf_t[y].push_back(make_pair(x, z));
    }
    fin.close();
}

void testEdmondsKarp(){
    ofstream fout("maxflow.out");
    fout<<EndmondsKarp();
    fout.close();
}

bool constructSTNesaturatedBF(int s, int t){
    int i, v, c;
    fill(viz.begin(), viz.end(), 0);
    queue<int> C;
    C.push(s);
    viz[s] = 1;

    while(!C.empty()) {
        i = C.front();
        if(i == t){
            C.pop();
            continue;
        }
        for(auto& j:graf_c[i]) {
            v = j.first; c = j.second;
            if (viz[v] == 0 && c > f[i][v]) { ///arc direct
                C.push(v);
                viz[v] = 1;
                tata[v] = i;
            }
        }
        for(auto& j:graf_t[i]){
            v = j.first;
            if(viz[v] == 0 && f[v][i] > 0){   ///arc invers
                C.push(v);
                viz[v] = 1;
                tata[v] = -i;
            }
        }
        C.pop();
    }
    if(viz[t])
        return true;
    return false;
}
void revizFlux(int s, int t, int& ip){
    int nod = t, parent, mod_nod;
    do{
        mod_nod = abs(nod);
        parent = tata[mod_nod];
        if(parent >= 0){
            f[parent][mod_nod] += ip;
        }else{
            f[mod_nod][abs(parent)] -= ip;
        }
        nod = tata[mod_nod];
    }while(abs(nod) != s);
}
int EndmondsKarp(){
    int s = 1, t = noNodes, minim;
    int sum = 0;
    while(constructSTNesaturatedBF(s, t)){
        for (auto& nodex: graf_t[t]) {
            int node = nodex.first;
            if (f[node][t] == c[node][t] || !viz[node])
                continue;

            tata[t] = node;
            minim = INFINITY;

            int nod = t, parent, mod_nod;
            do{
                mod_nod = abs(nod);
                parent = tata[mod_nod];
                if(parent >= 0){
                    minim = min(minim, c[parent][mod_nod] - f[parent][mod_nod]);
                }else{
                    minim = min(minim, f[mod_nod][abs(parent)]);
                }
                nod = tata[mod_nod];
            }while(abs(nod) != s);
            if (minim == 0)
                continue;

            revizFlux(s, t, minim);
            sum += minim;
        }
    }
    return sum;
}