#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#define N 1024
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int n,m,x,y,z,C[N][N],F[N][N],flow,bf(),T[N],i,j;
vector<int> v[N];
queue<int> Q;
void upd();
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        f>>x>>y>>z;
        v[x].push_back(y);
        C[x][y]=z;
    }
    while(bf())
        upd();
    g<<flow;
    return 0;
}
int bf()
{
    for(i=1;i<=n;i++)
        T[i]=0;
    T[1]=1;
    Q.push(1);
    while(Q.size())
    {
        j=Q.front();
        Q.pop();
        for(auto it:v[j])
            if(!T[it]&&C[j][it]>F[j][it])
            {
                T[it]=j;
                Q.push(it);
            }

    }
    return T[n];
}
void upd()
{
    int flux=1100001;
    for(i=n,j=T[n];i!=j;i=T[i],j=T[j])
    flux=min(flux,C[j][i]-F[j][i]);
    for(i=n,j=T[n];i!=j;i=T[i],j=T[j])
        F[j][i]+=flux;
    flow+=flux;
}