#include <fstream>
#include <string.h>
#include <queue>
#include <vector>
#define NMAX 1005
 
using namespace std;
 
/************************************/
/// INPUT / OUTPUT
 
ifstream f("maxflow.in");
ofstream g("maxflow.out");
/************************************/
/// GLOBAL DECLARATIONS
 
int N, M, S, D;
int maxFlow;
int flow[NMAX][NMAX], parent[NMAX], cap[NMAX][NMAX];
vector < int > adj[NMAX];
/************************************/
/// FUNCTIONS
 
void ReadInput();
void Solution();
void Output();
/************************************/
///-------------------------------------------------
inline void ReadInput()
{
    f >> N >> M;
    S = 1;
    D = N;
 
    for (int i = 1 ; i <= M ; ++ i)
    {
        int a, b, flux;
        f >> a >> b >> flux;
 
        cap[a][b] = flux;
        adj[a].push_back(b);
        adj[b].push_back(a); 
    }
}
///-------------------------------------------------
bool BFS()
{
    memset(parent, -1, sizeof(parent));
    queue < int > q;
    q.push(S);
 
    while (!q.empty())
    {
        int node = q.front();
        q.pop();
 
        for (auto u: adj[node])
        {
            if (parent[u] == -1 && cap[node][u] > 0)
            {
                parent[u] = node;
                if (u == D)
                    return 1;
                q.push(u);
            }
        }
    }
 
    return 0;
}
///-------------------------------------------------
inline void Solution()
{
    while (BFS())
    {
        int flux = 1e8;
 
        int node = D;
 
        while (node != S)
        {
            flux = min(flux, cap[parent[node]][node]);
            node = parent[node];
        }
 
        maxFlow += flux;    
        node = D;
 
        while (node != S)
        {
            int par = parent[node];
            cap[node][par] += flux;
            cap[par][node] -= flux;
            node = par;
        }
    }
}
///-------------------------------------------------
inline void Output()
{
    g << maxFlow;
}
///-------------------------------------------------
int main()
{
    ReadInput();
    Solution();
    Output();
    return 0;
}