#include <bits/stdc++.h>
#define INF 10000000

using namespace std;

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

int C[1010][1010], F[1010][1010];
int viz[1010], t[1010];
int n, m;
vector<int> v[1010];
queue<int> coada;

int bf()
{
    int nod, vec;
    for(int i=1; i<=n; i++) viz[i] = 0;
    coada.push(1);
    while(!coada.empty())
    {
        nod = coada.front();
        if(nod == n)
        {
            coada.pop();
            continue;
        }
        for(int i=0; i < v[nod].size(); i++)
        {
            vec = v[nod][i];
            if(viz[vec] || C[nod][vec] == F[nod][vec]) continue;
            coada.push(vec);
            t[vec] = nod;
            viz[vec] = 1;
        }
        coada.pop();
    }
    return viz[n];
}

int main()
{
    int x, y, z, fmin, flow=0;
    fin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        fin >> x >> y >> z;
        v[x].push_back(y);
        v[y].push_back(x);
        C[x][y] += z;
    }
    while(bf())
    {
        for(auto it:v[n])
        {
            if(F[it][n] == C[it][n] || !viz[it]) continue;
            t[n]=it;

            fmin = INF;
            for(int nod = n; nod!=1; nod = t[nod])
                fmin = min(fmin, C[t[nod]][nod]-F[t[nod]][nod]);
            if(fmin==0) continue;
            for(int nod = n; nod!=1; nod = t[nod])
            {
                F[t[nod]][nod] += fmin;
                F[nod][t[nod]] -= fmin;
            }
            flow += fmin;
        }

    }
    fout<<flow;

    return 0;
}