#include <fstream>
#include <vector>
#include <queue>

#define NMAX 1005

using namespace std;

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

const int inf = 1e9;

int n, C[NMAX][NMAX], pred[NMAX];
vector<int> G[NMAX];
queue<int> q;
bool viz[NMAX];

bool bfs(int s, int d)
{
    for(int i = 1; i <= n; ++i) viz[i] = 0;
    viz[s] = 1;
    q.push(s);
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(auto i : G[nod])
        {
            if(viz[i] || !C[nod][i]) continue;
            viz[i] = 1;
            pred[i] = nod;
            if(i != d) q.push(i);
        }
    }
    return viz[d];
}

int main()
{
    int m;
    fin >> n >> m;
    for(int i = 1, x, y, c; i <= m; ++i)
    {
        fin >> x >> y >> c;
        G[x].push_back(y);
        G[y].push_back(x);
        C[x][y] = c;
    }
    fin.close();

    int max_flow = 0;
    while(bfs(1, n))
    {
        for(auto i : G[n])
        {
            if(!viz[i] || !C[i][n]) continue;
            int aux = inf;
            pred[n] = i;
            for(int nod = n; nod != 1; nod = pred[nod]) aux = min(aux, C[pred[nod]][nod]);
            for(int nod = n; nod != 1; nod = pred[nod])
            {
                C[pred[nod]][nod] -= aux;
                C[nod][pred[nod]] += aux;
            }
            max_flow += aux;
        }
    }
    fout << max_flow;
    fout.close();
    return 0;
}