#include <bits/stdc++.h>

using namespace std;

const int Nmax = 1000 + 10;
const int inf = 0x3f3f3f3f;

int n , m , i , flow;
int S , D;
int dad[Nmax];

vector < int > g[Nmax];

int f[Nmax][Nmax] , c[Nmax][Nmax];
queue < int > q;

bool bfs()
{
    bool ok = false;


    for (q.push(S); !q.empty() ; q.pop())
    {
        int node = q.front();
        for (auto &it : g[node])
            if (!dad[it] && c[node][it] > f[node][it])
            {
                if (it != D) dad[it] = node, q.push(it);
                else ok = 1;
            }
    }

    return ok;
}

void dinic()
{
    S = 1; D = n;
    for (bool ok = bfs() ; ok ; ok = bfs())
    {
        for (auto &it : g[D])
            if (dad[it] && c[it][D] > f[it][D])
            {
                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;

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

        memset(dad , 0 , sizeof(dad));
    }
}

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

    scanf("%d %d", &n, &m);
    for (i = 1; i <= m; ++i)
    {
        int node1 , node2 , capacitate;
        scanf("%d %d %d", &node1, &node2, &capacitate);

        g[node1].push_back(node2);
        g[node2].push_back(node1);
        c[node1][node2] = capacitate;
    }

    dinic();

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

    return 0;
}