#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

inline int mni(int x, int y) { return (x < y ? x : y); }
const int maxn = 1005, maxm = 5005, inf = 0x3f3f3f3f;

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

struct edge
{
    int nod, flow;
};

vector <edge> gr[maxn];
vector <edge> res[maxn];
int used[maxn][maxn];

int n, m, i, x, y, z, ans;
bool is[maxn][maxn];

int dfs(int k, int mn)
{
    if(mn == 0) { return 0; }
    if(k == n) { return mn; }
    int nw = 0, rez = 0;
    for(auto u : gr[k])
    {
        if(is[k][u.nod] == false)
        {
            is[k][u.nod] = true;
            is[u.nod][k] = true;

            nw = dfs(u.nod, mni(mn, u.flow - used[k][u.nod]));
            used[k][u.nod] += nw;
            used[u.nod][k] += nw;
            rez += nw;
            mn -= nw;

            is[k][u.nod] = false;
            is[u.nod][k] = false;
        }
    }

    for(auto u : res[k])
    {
        if(is[k][u.nod] == false)
        {
            is[k][u.nod] = true;
            is[u.nod][k] = true;

            nw = dfs(u.nod, mni(mn, used[k][u.nod]));
            used[k][u.nod] -= nw;
            used[u.nod][k] -= nw;
            rez += nw;
            mn -= nw;

            is[k][u.nod] = false;
            is[u.nod][k] = false;
        }

    }
    return rez;
}

int main()
{
    f >> n >> m;
    for(i = 1; i <= m; i ++) {
        f >> x >> y >> z;
        gr[x].push_back({y, z});
        res[y].push_back({x, z}); // graf invers
    }

    ans = dfs(1, inf);

    g << ans << '\n';

    /*for(i = 1; i <= n; i ++) {
        for(auto u : gr[i]) {
            g << i << ' ' << u.nod << ' ' << u.flow << ' ' << used[i][u.nod] << '\n';
        }
    }*/

    f.close();
    g.close();
    return 0;
}
//edmonds karp v2