#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <string.h>
#define Nmax 1001
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int F[Nmax][Nmax],C[Nmax][Nmax],t[Nmax],n,FL;
vector <int> v[Nmax];
bool bf()
{
    int vec,nod,i;
    queue <int> q;
    memset(t,0,sizeof(t));
    t[1]=-1;
    q.push(1);
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for(i=0; i<v[nod].size(); ++i)
        {
            vec=v[nod][i];
            if(!t[vec]&&C[nod][vec]>F[nod][vec])
            {
                t[vec]=nod;
                q.push(vec);
            }
        }
    }
    if(t[n]) return 1;
    return 0;
}
void dinic()
{
    int i,j,vec,FC;
    while(bf())
        for(i=0; i<v[n].size(); ++i)
        {
            vec=v[n][i];
            if(t[vec]&&C[vec][n]>F[vec][n])
            {
                FC=C[vec][n]-F[vec][n];
                for(j=vec; j>1; j=t[j])
                    FC=min(FC,C[t[j]][j]-F[t[j]][j]);
                if(FC)
                {
                    F[vec][n]+=FC;
                    F[n][vec]-=FC;
                    for(j=vec; j>1; j=t[j])
                    {
                        F[t[j]][j]+=FC;
                        F[j][t[j]]-=FC;
                    }
                    FL+=FC;
                }
            }
        }
}
int main()
{
    int m,i,j,x,y,c;
    f>>n>>m;
    for(i=1; i<=m; i++)
    {
        f>>x>>y>>c;
        v[x].push_back(y);
        C[x][y]=c;
        v[y].push_back(x);
    }
    dinic();
    g<<FL;
}