#include <bits/stdc++.h>

using namespace std;

const int nmax = 1e3 + 10;
const int inf = 0x3f3f3f3f;

int n , m , i , S , D , flow;
int dad[nmax];
int f[nmax][nmax] , c[nmax][nmax];

vector < int > g[nmax];

void add(int x , int y , int C)
{
    g[x].push_back(y);
    g[y].push_back(x);

    c[x][y] = C;
}

bool bfs()
{
    memset(dad , -1 , sizeof(dad));
    dad[S] = -2; bool ok = 0;

    queue < int > q;
    for (q.push(S); q.size(); q.pop())
    {
        int node = q.front();

        for (auto &it : g[node])
        {
            if (dad[it] != -1) continue;
            if (f[node][it] <  c[node][it]); else continue;

            if (it != D) dad[it] = node, q.push(it);
            else ok = 1;
        }
    }

    return ok;
}

void bagaflux()
{
    while (bfs())
    {
        for (auto &it : g[D])
        {
            if (dad[it] == -1) continue;

            dad[D] = it;
            int minn = inf;

            for (int node = D; node != S; node = dad[node])
                minn = min(minn , c[dad[node]][node] - f[dad[node]][node]);

            if (minn <= 0) continue; ///plm

            flow += minn;
            for (int node = D; node != S; node = dad[node])
                f[dad[node]][node] += minn,
                f[node][dad[node]] -= minn;
        }
    }
}

int main()
{
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);

    scanf("%d %d", &n, &m);
    for (i = 1; i <= m; ++i)
    {
        int x , y, z;
        scanf("%d %d %d", &x, &y, &z);
        add(x , y , z);
    }

    S = 1; D = n;
    bagaflux();

    printf("%d\n", flow);

    return 0;
}