#include <bits/stdc++.h>

using namespace std;

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

struct Dinic
{
    struct Edge
    {
        int from, to, cap, ult;
    };

    int n;
    vector<int> dist, last;
    vector<Edge> edges;
    queue<int> coada;

    Dinic(int cn)
    {
        n = cn;
        last.assign(n + 1, -1);
    }

    void baga(int from, int to, int cap)
    {
        edges.push_back({from, to, cap, last[from]});
        last[from] = edges.size() - 1;

        edges.push_back({to, from, 0, last[to]});
        last[to] = edges.size() - 1;
    }

    bool bfs(int source, int sink)
    {
        dist.assign(n + 1, 1e9);
        coada.push(source);
        dist[source] = 0;

        while(!coada.empty())
        {
            int x = coada.front();
            coada.pop();

            for(int y = last[x]; y != -1; y = edges[y].ult)
            {
                if(edges[y].cap > 0 && dist[edges[y].to] == 1e9)
                {
                    dist[edges[y].to] = dist[x] + 1;
                    coada.push(edges[y].to);
                }
            }
        }

        return dist[sink] != 1e9;
    }

    int dfs(int source, int sink, int flow)
    {
        if(source == sink)
            return flow;

        int ans = 0;
        for(int y = last[source]; y != -1; y = edges[y].ult)
        {
            if(edges[y].cap > 0 && dist[edges[y].to] == dist[edges[y].from] + 1)
            {
                int trimis = dfs(edges[y].to, sink, min(flow, edges[y].cap));

                ans += trimis;
                flow -= trimis;

                edges[y].cap -= trimis;
                edges[y ^ 1].cap += trimis;
            }
        }

        return ans;
    }

    int MaxFlow(int source, int sink)
    {
        int ans = 0;

        while(bfs(source, sink))
            ans += dfs(source, sink, 1e9);

        return ans;
    }
};



int main()
{
    int n, m, u, v, w;
    in >> n >> m;
    Dinic d(n);
    for(int i = 0; i < m; i ++)
        in >> u >> v >> w, d.baga(u, v, w);
    out << d.MaxFlow(1, n);
}