#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream in("maxflow.in");
ofstream out("maxflow.out");

vector<int> adjList [5005];
int cap[5005][5005];
int n,m;
void read(){
    in >> n >>m;
    int x, y, z;
    for(int i = 0; i < m; i++)
    {
        in >> x >> y >> z;
        adjList[x].emplace_back(y);
        adjList[y].emplace_back(x);
        cap[x][y] = z;
        cap[y][x] = 0;
    }
}

int BFS(int source, int dest, vector<int>& parent)
{
    fill(parent.begin(), parent.end(), -1);
    parent[source] = -2;
    queue<int> q;
    // capacitatea minima pe drumul de crestere actual
    int mnCap = INT_MAX;
    q.push(source);
    while(!q.empty()) {
        int pNode = q.front(); //nodul parinte
        q.pop();
        for (auto el: adjList[pNode])
        {
            int cNode = el; // copiii nodului parinte actual
            int cost = cap[pNode][cNode];
            if(cNode != pNode && parent[cNode] == -1 && cost != 0)
            {
                parent[cNode] = pNode;
                // pastram minimul pentru drumul de crestere curent
                mnCap = min(mnCap, cost);
                if(cNode == dest)
                {
                    return mnCap;
                }
                //adaugam urmatorul nod ce urmeaza sa fie vizitat
                q.push({cNode});
            }
        }
    }
    return 0;
}


int FordFulkerson(int source, int dest)
{
    vector<int> parent(n + 1, -1);
    int mxFlow = 0;
    int mnCap = 0;


    mnCap = BFS(source, dest, parent);
    while(mnCap)
    {
        mxFlow += mnCap;


        int tNode = dest;

        while(tNode != source){
            int nNode = parent[tNode];
            cap[nNode][tNode] -= mnCap;
            cap[tNode][nNode] += mnCap;
            tNode = nNode;
        }

        mnCap = BFS(source, dest, parent);
    }
    return mxFlow;
}

int main()
{
    read();

    out<<FordFulkerson(1, n);
    return 0;
}