#include <fstream>
#include <vector>
#include <cstring>
#define x first
#define y second
#define mp make_pair
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int i,j,n,m,p[1005],a,b,c[1001][1001],nod,ok,mini,oc[1001][1001];
long long int flow;
vector <int > v[1005];
void dfs(int nod)
{
    int i;
    for(i = 0; i < v[nod].size(); i++)
    {
        if(ok)  return;
        int nxt = v[nod][i];
        if(c[nod][v[nod][i]]>0 && p[nxt] == 0)
        {
            p[nxt] = nod;
            if(nxt == n)
            {
                ok = 1;
                mini = c[nod][nxt];
                for(i = nod; i>1; i = p[i])
                    mini = min(mini, c[p[i]][i]);
                for(i = nod; i>1; i = p[i])
                {
                     c[p[i]][i]-=mini;
                     c[i][p[i]]+=mini;
                }
                flow += mini;
                c[nod][nxt] -= mini;
                return;
            }
            else
                dfs(nxt);
        }
    }
}
int main()
{
    fin >> n >> m;
    for(i = 1; i <= m; i++)
    {
        fin >> a >> b >> j;
        v[a].push_back(b);
        v[b].push_back(a);
        c[a][b] = j;
    }
    ok = 1;
    while(ok)
    {
        ok = 0;
        p[1] = -1;
        dfs(1);
        memset(p,0,sizeof(p));
    }
    fout<<flow;
    a++;
    b++;
return 0;
}