#include <bits/stdc++.h>
using namespace std;

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

int n, m, c[1024][1024], f[1024][1024], t[1024];
vector<int> g[1024];
bool v[1024];

bool bfs() {
    queue<int> q;
    q.push(1);
    for(int i = 1; i <= n; i++) v[i] = false;
    while(!q.empty()) {
        int cur = q.front();
        q.pop();

        for(auto next: g[cur])
            if(!v[next] && c[cur][next] > f[cur][next]) {
                t[next] = cur;
                v[next] = true;
                if(next == n) return true;
                q.push(next);
            }
    }
    return false;
}

int main() {
    fin >> n >> m;
    while(m--) {
        int u, v, t;
        fin >> u >> v >> t;
        g[u].push_back(v);
        g[v].push_back(u);
        c[u][v] = t;
    }

    int flow = 0, fmin;
    for( ; bfs(); ) {
        for(auto next: g[n]) {
            if(!v[next] || c[next][n] <= f[next][n]) continue;
            t[n] = next;

            fmin = 2e9;
            for(int i = n; i != 1; i = t[i])
                fmin = min(fmin, c[t[i]][i]-f[t[i]][i]);

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