#include <bits/stdc++.h>
#define NMAX 1005

using namespace std;

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

int n, m, c[NMAX][NMAX], f[NMAX][NMAX], t[NMAX];
bitset <NMAX> v;
queue <int> q;
vector <int> edges[NMAX];

bool bfs()
{
    bool ok = 0;

    for(int i = 1; i <= n; i++)
        v[i] = 0;

    v[1] = 1;
    q.push(1);

    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(auto k : edges[nod])
            if(c[nod][k] - f[nod][k] > 0 && !v[k])
            {
                q.push(k);
                v[k] = 1;
                t[k] = nod;
                if(k == n)
                    ok = 1;
            }
    }
    return ok;
}

int main()
{
    fin >> n >> m;

    for(int i = 1; i <= m; i++)
    {
        int x, y, z;
        fin >> x >> y >> z;
        edges[x].push_back(y);
        edges[y].push_back(x);
        c[x][y] = z;
    }

    int minim, flux = 0;
    while(bfs())
    {
        for(auto k : edges[n])
        {
            if(c[k][n] > f[k][n] && v[k])
            {
                minim = c[k][n] - f[k][n];
                int p = k;
                while(t[p])
                {
                    minim = min(c[t[p]][p] - f[t[p]][p], minim);
                    p = t[p];
                }
                flux += minim;

                f[k][n] += minim;
                f[n][k] -= minim;

                p = k;
                while(t[p])
                {
                    f[t[p]][p] += minim;
                    f[p][t[p]] -= minim;
                    p = t[p];
                }
            }
        }
    }

    fout << flux;
    return 0;
}