#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#include <climits>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int n, m, cap[1005][1005], x, y, capacitate, flux[1005][1005];
vector<int>ad[1005];
int viz[1005], tata[1005];
int BF()
{
    queue<int>q;
    q.push(1);
    viz[1] = 1;
    memset(viz, 0, sizeof(viz));

    while(!q.empty())
    {
        int curr = q.front();
        q.pop();
        for(int j = 0; j < ad[curr].size(); j++)
        {
            int v = ad[curr][j];
            if(flux[curr][v] == cap[curr][v] || viz[v] != 0) continue;
            viz[v] = 1;
            q.push(v);
            tata[v] = curr;
            if(v == n)
                return 1;

        }
    }
    return 0;

}
int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y >> capacitate;
        cap[x][y] = capacitate;
        ad[x].push_back(y);
        ad[y].push_back(x);
    }
    int fluxmax = 0, minflux;
    while(BF())
    {
        for(int i = 0; i < ad[n].size(); i++)
        {
            int nod = ad[n][i];
            minflux = INT_MAX;
            if(flux[nod][n] == cap[nod][n] || !viz[nod])continue;

            tata[n] = nod;

            for (nod = n; nod != 1; nod = tata[nod])
				minflux = min(minflux, cap[tata[nod]][nod]-flux[tata[nod]][nod]);
			if (minflux == 0) continue;

            for (nod = n; nod != 1; nod = tata[nod])
			{
			    flux[tata[nod]][nod] += minflux;
				flux[nod][tata[nod]] -= minflux;
			}

			fluxmax += minflux;

        }
    }
    fout << fluxmax;
    return 0;
}