#include <bits/stdc++.h>
using namespace std;

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

int N, M;

int cap[1005][1005], flow[1005][1005], maxflow;

vector <int> v[1005];

bool viz[1005];
int path[1005];

bool bfs()
{
    fill(viz + 1, viz + N + 1, 0);

    queue <int> q;

    q.push(1);

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

        for(int i = 0; i < v[node].size(); i++)
            if(cap[node][v[node][i]] > flow[node][v[node][i]] && viz[v[node][i]] == false)
        {
            viz[v[node][i]] = true;
            q.push(v[node][i]);
            path[v[node][i]] = node;
        }
    }

    return viz[N];
}

int main()
{
    fin >> N >> M;

    for(int i = 1; i <= M; i++)
    {
        int x, y, z;

        fin >> x >> y >> z;

        v[x].push_back(y);
        v[y].push_back(x);

        cap[x][y] = z;
    }

    while(bfs())
    {
        for(int i = 0; i < v[N].size(); i++)
        {
            int ngb = v[N][i];
            int toadd = cap[ngb][N] - flow[ngb][N];

            for(int it = ngb; it != 1; it = path[it])
                toadd = min(toadd, cap[path[it]][it] - flow[path[it]][it]);

            maxflow += toadd;

            for(int it = ngb; it != 1; it = path[it])
            {
                flow[path[it]][it] += toadd;
                flow[it][path[it]] -= toadd;
            }
        }
    }

    fout << maxflow;

    return 0;
}