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

using namespace std;

const int dim = 1005;

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

vector <int> vec[dim];

int t[dim],viz[dim],c[dim][dim],n,m;

int BFS(int sursa,int destinatie)
{
    memset(viz,0,sizeof(viz));
    queue<int> q;
    q.push(sursa);
    viz[sursa] = 1;
    while (!q.empty())
    {
        int x = q.front();
      ///  cout << x << " ";
        q.pop();
        for (int j=0; j<vec[x].size(); j++)
        {
            int y = vec[x][j];
            if (!viz[y] && c[x][y] > 0)
            {
                viz[y] = 1;
                t[y] = x;
                q.push(y);
            }
        }
    }
    ///cout << endl;
    return viz[destinatie];
}

int Get_Flux(int sursa,int destinatie)
{
    int maxflow = 0;
    int fmin = 1e9;
    ///cout << BFS(sursa, destinatie, vec,c) << "\n";
   /// int ok =
    int ok = BFS(sursa, destinatie);
    while (ok)
    {
        for (int j=0; j<vec[destinatie].size(); j++)
        {
            int y = vec[destinatie][j];
            //cout << y << " ";

            t[destinatie] = y;
            fmin = 1e9;
            for (int i=destinatie; i != sursa ; i=t[i])
            {
                fmin = min(fmin, c[t[i]][i]);
            }
         ///   cout << fmin << " ";
            for (int i=destinatie; i != sursa ; i=t[i])
            {
                c[t[i]][i] -= fmin;
                c[i][t[i]] += fmin;
            }
           /// cout << maxflow < " ";
            maxflow += fmin;
        }
        ok = BFS(sursa, destinatie);
        ///ok = 0;
    }
    return maxflow;
}

int main()
{
    in >> n >> m;
    for (int i=1; i<=m; i++)
    {
        int x,y,f;
        in >> x >> y >> f;
        vec[x].push_back(y);
        vec[y].push_back(x);
        c[x][y] = f;
    }
    out << Get_Flux(1,n);
    return 0;
}