#include <bits/stdc++.h>

using namespace std;
#ifndef HOME
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
#else
ifstream fin("ciorna.in");
ofstream fout("ciorna.out");
#endif
using ll = long long;
class Flow {
    const int max_flow = 1e9;
    struct Edge { int from, to, cap; };
    vector <Edge> edges;
    vector <int> rem, lvl;
    vector <vector <int>> g;
    int n, s, t, k;
public:
    Flow (int n) : edges(0), rem(n + 1), lvl(n + 1), g(n + 1), n(n), s(1), t(n), k(0) {}
    void add_edge(int u, int v, int w) {
        g[u].push_back(k++);
        g[v].push_back(k++);
        edges.push_back({u, v, w});
        edges.push_back({v, u, 0});
    }
    bool bfs() {
        fill(lvl.begin(), lvl.end(), 0);
        queue <int> q; lvl[s] = 1;
        for(q.push(s); !q.empty(); q.pop()) {
            int u = q.front();
            for(int id : g[u]) {
                int v = edges[id].to;
                if(edges[id].cap && !lvl[v]) {
                    lvl[v] = lvl[u] + 1;
                    q.push(v);
                }
            }
        }
        return lvl[t];
    }
    int dfs(int u, int flow) {
        if(u == t || !flow) return flow;
        for(int& cid = rem[u]; cid < g[u].size(); cid++) {
            int id = g[u][cid];
            int v = edges[id].to;
            if(lvl[u] != lvl[v] - 1 || !edges[id].cap) continue;
            ll f = dfs(v, min(flow, edges[id].cap));
            if(!f) continue;
            edges[id].cap -= f;
            edges[id ^ 1].cap += f;
            return f;
        }
        return 0;
    }
    ll dinic() {
        ll flow = 0;
        while(bfs()) {
            fill(rem.begin(), rem.end(), 0);
            while(int f = dfs(s, max_flow))
                flow += f;
        }
        return flow;
    }
};

int main()
{
    int n, m;
    fin >> n >> m;
    Flow F(n);
    for(int i = 1, u, v, w; i <= m; i++)
        fin >> u >> v >> w,
        F.add_edge(u, v, w);
    fout << F.dinic();
    return 0;
}