#include <fstream>

using namespace std;

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

int cap[1005][1005], s, t, F = 0, n, m, flux[1005][1005], q[1005], tata_mare[1005];
bool viz[1005];

struct nod
{
    int info;
    nod *adr;
} *v[1005], *pq, *uq;

void adauga (int x, int y)
{
    nod *c;
    c = new nod;

    c -> info = y;
    c -> adr = v[x];
    v[x] = c;
}

void citire ()
{
    f >> n >> m;

    int x, y, c;

    for (int i = 1; i <= m; i ++)
    {
        f >> x >> y >> c;

        adauga (x, y);
        adauga (y, x);
        cap[x][y] = c;
    }
}

bool bfs ()
{
    for (int i = 1; i <= n; i ++)
        viz[i] = 0;

    int p, u, curent;
    p = u = 1;
    q[u] = s;
    viz[s] = 1;

    nod *c;

    while (p <= u)
    {
        curent = q[p];
         ++ p;

        if (curent != t)

        {c = v[curent];

        while (c)
            {
                if (cap[curent][c -> info] > flux[curent][c -> info] && !viz[c -> info])
                    {
                        ++ u;
                        q[u] = c -> info;
                        tata_mare[c -> info] = curent;
                        viz[c -> info] = 1;
                        if (c -> info == t)
                            return 1;
                    }

            c = c -> adr;
            }
        }

    }

    return viz[t];
}

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

int main()
{
    citire ();
    s = 1;
    t = n;

    int curent, minim, inapoi;
    nod *c;

    while (bfs ())
    {
        c = v[t];
        while (c)
        {
            curent = c -> info;

            tata_mare[t] = curent;

            minim = (1 << 31) - 1;

            inapoi = t;

            while (inapoi != s)
            {
                minim = mini (minim, cap[tata_mare[inapoi]][inapoi] - flux[tata_mare[inapoi]][inapoi]);
                inapoi = tata_mare[inapoi];
            }

            inapoi = t;

            while (inapoi != s)
                {
                    flux[tata_mare[inapoi]][inapoi] += minim;
                    flux[inapoi][tata_mare[inapoi]] -= minim;
                    inapoi = tata_mare[inapoi];
                }

                 F += minim;

            c = c -> adr;
        }
    }

    g << F;

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