#include <fstream>
#include <cstring>
#include <vector>

const int NMAX = 1024;
const int inf = 0x3f3f3f3f;

using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");

int N,M,C[NMAX][NMAX],F[NMAX][NMAX],x,y,z,Q[NMAX],TT[NMAX],fmin,flow;
bool viz[NMAX];
vector <int> v[NMAX];

int minim(int a, int b)
{
    if (a < b)
        return a;
    return b;
}

int BFS()
{
    int nod,V;
    Q[0] = 1;
    Q[1] = 1;
    memset(viz, false, sizeof(viz));
    viz[1] = 1;

    for (int i = 1; i <= Q[0]; ++i)
    {
        nod = Q[i];
        for (int j = 0; j < v[nod].size(); ++j)
        {
            V = v[nod][j];
            if (viz[V] || (F[nod][V] == C[nod][V]))
                continue;
            viz[V] = true;
            Q[ ++Q[0] ] = V;
            TT[V] = nod;
            if (V == N) return 1;
        }
    }
    return 0;
}

int main()
{
    f >> N >> M;
    for (int i = 1; i <= M; ++i)
    {
        f >> x >> y >> z;
        C[x][y] = z;
        v[x].push_back(y);
        v[y].push_back(x);
    }

    for (flow = 0; BFS(); flow += fmin )
    {
        fmin = inf;
        for (int i = N; i != 1; i = TT[i])
        {
            fmin = minim( fmin, C[ TT[i] ][i] - F[ TT[i] ][i]);
        }
        for (int i = N; i != 1; i = TT[i])
        {
            F[ TT[i] ][i] += fmin;
            F[i][ TT[i] ] -= fmin;
        }
    }

    g << flow;

    f.close();
    g.close();
    return 0;
}