#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

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

int n, m;
vector<int> adj[1001];
int capacity[1001][1001];

int maxflow()
{
    int source = 1;
    int sink = n;
    int flux = 0;

    while (true)
    {
        vector<int> parent(n + 1, -1);
        queue<int> q;

        q.push(source);
        parent[source] = source;

        while (!q.empty() && parent[sink] == -1)
        {
            int u = q.front();
            q.pop();

            for (int v : adj[u])
            {
                if (parent[v] == -1 && capacity[u][v] > 0)
                {
                    parent[v] = u;
                    q.push(v);
                }
            }
        }

        if (parent[sink] == -1)
            break;

        // capacitatea minima pe drum
        int increment = 1e9;
        for (int v = sink; v != source; v = parent[v])
        {
            int u = parent[v];
            increment = min(increment, capacity[u][v]);
        }

        flux += increment;
        for (int v = sink; v != source; v = parent[v])
        {
            int u = parent[v];
            capacity[u][v] -= increment;
            capacity[v][u] += increment;
        }
    }
    return flux;
}

int main()
{
    fin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int a, b, c;
        fin >> a >> b >> c;
        adj[a].push_back(b);
        adj[b].push_back(a);
        capacity[a][b] = c;
    }
    fout << maxflow() << "\n";
    return 0;
}