#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;

vector <int> g[1002];
int n,m,tata[1002],flux[1002][1002],capacitate[1002][1002],total;
queue < int > q;
void citire()
{
    scanf("%d%d",&n,&m);
    int nod1,nod2,cost;
    for (int i=1; i<=m; ++i)
    {
        scanf("%d%d%d",&nod1,&nod2,&cost);
        g[nod1].push_back(nod2);
        g[nod2].push_back(nod1);
        capacitate[nod1][nod2]=cost;
    }
}
int bfs()
{
    q.push(1);
    memset(tata,0,sizeof(tata));
    tata[1]=1;
    while (!q.empty())
    {
        int nod=q.front();
        q.pop();

        if (nod==n)
            continue;
        for (vector <int>:: iterator it=g[nod].begin(); it!=g[nod].end(); ++it)
        {
            if (tata[*it] || capacitate[nod][*it]==flux[nod][*it])
                continue;
            tata[*it]=nod;
            q.push(*it);
        }
    }
    return tata[n];
}
int main()
{
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
    citire();
    while (bfs())
    {
        for (int i=0; i<g[n].size(); ++i)
        {
            int penultim=g[n][i];
            if (tata[penultim] && capacitate[penultim][n]>0)
            {
                tata[n]=penultim;
                int flux_min=inf;
                for (int j=n; j!=1; j=tata[j])
                    if (flux_min > capacitate[tata[j]][j])
                        flux_min=capacitate[tata[j]][j];

                for (int j=n; j!=1; j=tata[j])
                {
                    capacitate[tata[j]][j]-=flux_min;
                    capacitate[j][tata[j]]+=flux_min;
                }
                total+=flux_min;
            }
        }
    }
    printf("%d",total);
    return 0;
}