#include <fstream>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
ifstream cin("maxflow.in");
ofstream cout("maxflow.out");
int n,m,i,j,x,y,z,rez,minim,nod;
int c[1001][1001],f[1001][1001],pred[1001];
bool viz[1001];
vector<int> graf[1001];
queue<int> coada;
int bfs()
{
    int ok,nod;
    memset(viz,0,sizeof(viz));
    while(!coada.empty())
        coada.pop();
    coada.push(1); viz[1]=true;
    while(!coada.empty())
    {
        ok=coada.front(); coada.pop();
        if(ok==n)
            return 1;

        for(int i=0; i<graf[ok].size(); i++)
        {
            nod=graf[ok][i];
            if(!viz[nod] && c[ok][nod]>f[ok][nod])
            {
                viz[nod]=1;
                pred[nod]=ok;
                coada.push(nod);
            }
        }
    }

    return 0;
}
int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y>>z;
        graf[x].push_back(y);
        graf[y].push_back(x);
        c[x][y]=z;
    }
    while(bfs())
    {
        for(i=0; i<graf[n].size(); i++)
        {
            nod=graf[n][i];
            if(f[nod][n]<c[nod][n] && viz[nod])
            {
                pred[n]=nod;
                minim=999999;
                for(j=n; j!=1; j=pred[j])
                    if(minim>c[pred[j]][j]- f[pred[j]][j])
                        minim=c[pred[j]][j]- f[pred[j]][j];

                for(j=n; j!=1; j=pred[j])
                {
                    f[pred[j]][j]+=minim;
                    f[j][pred[j]]-=minim;
                }
                rez+=minim;
            }
        }
    }
    cout<<rez;
}