#include <bits/stdc++.h>

using namespace std;


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



struct Flow
{

    struct Edge
    {
        int from, to, cap, ult;
    };
    vector<Edge> edges;
    vector<int> last, dist;
    queue<int> coada;
    int n;

    Flow(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 sursa, int destinatie)
    {
        dist.assign(n + 1, 1e9);
        coada.push(sursa);
        dist[sursa] = 0;
        while(!coada.empty())
        {
            int x = coada.front();
            coada.pop();
            for(int y = last[x]; y != -1; y = edges[y].ult)
            {
                if(dist[edges[y].to] == 1e9 && edges[y].cap > 0)
                {
                    dist[edges[y].to] = dist[edges[y].from] + 1;
                    coada.push(edges[y].to);
                }
            }
        }
        return (dist[destinatie] != 1e9);
    }

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

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

                flux -= trimis;
                ans += trimis;
            }
        }
        return ans;
    }

    int MaxFlow(int sursa, int destinatie)
    {
        int ans = 0;
        while(bfs(sursa, destinatie))
            ans += dfs(sursa, destinatie, 1e9);
        return ans;
    }
};




int main()
{
    int n, m;
    in >> n >> m;

    Flow X(n + 1);

    for(int i = 0; i < m; i++)
    {
        int x, y, z;
        in >> x >> y >> z;
        X.baga(x, y, z);
    }
    out << X.MaxFlow(1, n);
}