#include <fstream>
#include <vector>
#include <queue>
#include <cstring>

using namespace std;

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

const int INF = 2e9;

int n, m;

int c[1001][1001];
int f[1001][1001];

vector < int > adj[1001];

bool used[1001];

int parent[1001];

bool bfs(int source, int dest)
{
    queue < int > q;

    memset(used, false, sizeof(used));

    q.push(source);
    used[source] = true;

    while (!q.empty())
    {
        int node = q.front();
        q.pop();

        used[node] = true;

        if (node == dest)
            continue;

        for (auto it : adj[node])
            if (!used[it] && f[node][it] != c[node][it])
            {
                q.push(it);
                used[it] = true;
                parent[it] = node;
            }
    }

    return used[dest];
}

int main()
{
    fin >> n >> m;

    for (int i = 1; i <= m; i++)
    {
        int x, y, z; fin >> x >> y >> z;
        adj[x].push_back(y);
        adj[y].push_back(x);
        c[x][y] = z;
    }

    int flow = 0;

    while (bfs(1, n))
        for (auto it : adj[n])
            if (used[it] && f[it][n] != c[it][n])
            {
                parent[n] = it;

                int fmin = INF;

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

                for (int i = n; i != 1; i = parent[i])
                {
                    f[parent[i]][i] += fmin;
                    f[i][parent[i]] -= fmin;
                }

                flow += fmin;
            }

    fout << flow << "\n";

    return 0;
}