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

using namespace std;

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

int N, M, start=1, dest, maxim=INT_MAX, temp, next, path_flow;
long max_flow;
vector<vector<int>> capacitate;
vector<int> parinte;
vector<vector<int>> la;

void read(){
    for(int i = 1; i <= M; i++)
    {
        int x, y;
        long z;
        fin >> x >> y >> z;
        la[x].push_back(y);
        la[y].push_back(x);
        capacitate[x][y] = z;
    }
}

int bfs()
{
    vector<bool> viz(N+1);
    queue<int> coada;
    coada.push(1);
    viz[start] = true;
    parinte[start] = -1;
    while(!coada.empty())
    {
        int u = coada.front();
        coada.pop();
        for(auto v: la[u])
        {
            if(capacitate[u][v]!=0 && !viz[v])
            {
                parinte[v] = u;
                if(v == dest)
                    return 1;
                viz[v] = true;
                coada.push(v);
            }
        }
    }
    return 0;
}

void maxflow()
{
    int new_flow=bfs();
    while(new_flow)
    {
        int next=dest, temp, path_flow = maxim;
        while(next != 1)
        {
            temp = parinte[next];
            path_flow=min(capacitate[temp][next],path_flow);
            next = parinte[next];
        }
        next=dest;
        while(next != 1)
        {
            temp = parinte[next];
            capacitate[temp][next] -= path_flow;
            capacitate[next][temp] += path_flow;
            next = parinte[next];
        }
        max_flow = max_flow + path_flow;
        new_flow=bfs();
    }
    fout<<max_flow;

}

int main()
{
    fin >> N >> M;
    dest = N;
    la.resize(N + 1);
    capacitate.resize(N+1, vector<int>(N+1));
    parinte.resize(N + 1);
    read();
    maxflow();
    return 0;
}