#include <bits/stdc++.h>
#define pb push_back
using namespace std;
ifstream fi("maxflow.in");
ofstream fo("maxflow.out");

const int NMAX = 1005;
const int INF = (1e9);

int n, m;
int C[NMAX][NMAX], F[NMAX][NMAX];
vector <int> G[NMAX];
int p[NMAX];
queue <int> Q;
bool viz[NMAX];

int bfs()
{
    memset(viz, 0, sizeof(viz));
    ///memset(p, 0, sizeof(p));

    while (!Q.empty())
        Q.pop();

    Q.push(1);
    viz[1] = 1;

    while (!Q.empty())
    {
        int curr = Q.front();
        Q.pop();

        if (curr == n)
            continue;

        for (auto v: G[curr])
        {
            if (viz[v] || F[curr][v] == C[curr][v])
                continue;

            Q.push(v);
            viz[v] = 1;
            p[v] = curr;
        }
    }
    return viz[n];
}

int main()
{
    fi >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int u, v, c;
        fi >> u >> v >> c;
        G[u].pb(v);
        G[v].pb(u);
        C[u][v] = c;
    }

    int flow = 0;

    while (bfs())
    {
        for (auto v: G[n])
        {
            if (F[v][n] == C[v][n] || !viz[v])
                continue;

            p[n] = v;

            int minim = INF;

            for (int nod = n; nod != 1; nod = p[nod])
                minim = min(minim, C[p[nod]][nod] - F[p[nod]][nod]);

            for (int nod = n; nod != 1; nod = p[nod])
            {
                F[p[nod]][nod] += minim;
                F[nod][p[nod]] -= minim;
            }
            flow += minim;
        }
    }
    fo << flow;
    return 0;
}