#include <cstdio>
#include <vector>
#include <bitset>
#include <queue>

using namespace std;

const int nmx = 1002;
const int inf = 0x3f3f3f3f;

int n,m,capacitate[nmx][nmx],flux[nmx][nmx],total,tata[nmx];
vector <int> g[nmx];
bitset <nmx> viz;
queue <int> q;

void citire() {
    scanf("%d %d", &n, &m);
    int nod1,nod2,cost;
    for(int i = 1; i <= m; ++i) {
        scanf("%d %d %d", &nod1, &nod2, &cost);
        capacitate[nod1][nod2] = cost;
        g[nod1].push_back(nod2);
        g[nod2].push_back(nod1);
    }
}

bool bfs() {
    while(not q.empty())
        q.pop();
    q.push(1);
    viz.reset();
    while(not q.empty()) {
        int nod = q.front();
        q.pop();
        for(vector<int>::iterator it = g[nod].begin(); it != g[nod].end(); ++it) {
            if(capacitate[nod][*it] == flux[nod][*it] || viz[*it] == true)
                continue;
            viz[*it] = true;
            q.push(*it);
            tata[*it] = nod;
            if(*it == n)
                return 1;
        }
    }
    return 0;
}

int main() {
    freopen("maxflow.in", "r", stdin);
    freopen("maxflow.out", "w", stdout);
    citire();
    while(bfs()) {
        int nod = n, minim = inf;
        while(nod != 1) {
            minim = min(minim,capacitate[tata[nod]][nod] - flux[tata[nod]][nod]);
            nod = tata[nod];
        }
        total += minim;
        nod = n;
        while(nod != 1) {
            flux[tata[nod]][nod] += minim;
            flux[nod][tata[nod]] -= minim;
            nod = tata[nod];
        }
    }
    printf("%d\n", total);
    return 0;
}