#include <bits/stdc++.h>
///Dinic
using namespace std;
ifstream fin ("maxflow.in");
ofstream fout ("maxflow.out");
void read();
vector<int> v[1005];
vector<int> g[1005];
int n, m, minn, flow;
int c[1005][1005], f[1005][1005], p[1005], d[1005];
bitset<1005> viz;
bool bfs()
{
    for(int i=1; i<=n; i++)
        g[i].clear();
    queue<int> q;
    q.push(1);
    for(int i=1; i<=n; i++)
        viz[i] = 0, d[i] = 0;
    viz[1] = 1;
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(auto it:v[nod])
            if(!viz[it] && c[nod][it]-f[nod][it] > 0)
            {
                d[it] = d[nod]+1;
                q.push(it);
                viz[it] = 1;
            }
    }
    if(viz[n])
    {
        for(int i=1; i<=n; i++)
            for(auto it:v[i])
                if(c[i][it]-f[i][it] > 0 && abs(d[i]-d[it]) == 1)
                    g[i].push_back(it);
        return 1;
    }
    return 0;
}
int dfs(int nod)
{
    if(nod == n)
        return INT_MAX;
    viz[nod] = 1;
    bool ok = 0;
    int minn_aux = minn;
    for(auto it:g[nod])
        if(!viz[it] && c[nod][it]-f[nod][it] > 0)
        {
            minn = min(minn, min(c[nod][it]-f[nod][it],dfs(it)));
            if(minn == 0)
                minn = minn_aux;
            else
            {
                p[it] = nod;
                ok = 1;
                break;
            }
        }
    if(!ok)
        return 0;
    return minn;
}
int main()
{
    read();
    while(bfs())
    {
        for(int i=1; i<=n; i++)
            viz[i] = 0;
        minn = INT_MAX;
        while(dfs(1))
        {
            int nod = n;
            while(p[nod])
            {
                f[p[nod]][nod]+=minn;
                f[nod][p[nod]]-=minn;
                nod = p[nod];
            }
            flow+=minn;
            for(int i=1; i<=n; i++)
                viz[i] = 0, p[i] = 0;
            minn = INT_MAX;
        }
    }
    fout << flow;
    return 0;
}
void read()
{
    fin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        int x, y, ca;
        fin >> x >> y >> ca;
        v[x].push_back(y);
        c[x][y] = ca;
    }
}