//altsmecher
using namespace std;

#include<iostream>
#include<fstream>
#include<vector>
#define nmax 1005
#define oo 0x3f3f3f3f
#define pb push_back
ofstream fout("maxflow.out");
vector<int> G[nmax];
int C[nmax][nmax], F[nmax][nmax],viz[nmax],ante[nmax],q[nmax];
int N,M;


bool BFS()
{int i;
    for(i=0;i<=N;i++)
    {
        viz[i]=0;
        q[i]=0;
    }
    vector<int>::iterator it;
    int front=1;
    viz[1]=1;
    q[++q[0]]=1;
    int u;
    while(front<=q[0])
    {
        u=q[front++];
        for(it=G[u].begin();it<G[u].end();it++)
        {
            if(!viz[*it] && C[u][*it]>F[u][*it])
            {
                viz[*it]=1;
                ante[*it]=u;
                q[++q[0]]=*it;

            }
        }
    }

    return viz[N];
}

void solve()
{int fmin,i,flow;
vector<int>::iterator it;
//cout<<1;
    for( flow=0;BFS();)
    {
        for(it=G[N].begin();it<G[N].end();it++)
        if(viz[*it])
        {
            fmin=C[*it][N]-F[*it][N];
            for(i=*it;i>1;i=ante[i])
            {
                fmin=min(fmin,C[ante[i]][i]-F[ante[i]][i]);
            }
            F[*it][N]+=fmin;
            F[N][*it]-=fmin;
            for(i=*it;i>1;i=ante[i])
            {
                F[ante[i]][i]+=fmin;
                F[i][ante[i]]-=fmin;
            }
            flow+=fmin;
        }
    }
    fout<<flow<<"\n";
}

void cit()
{

    ifstream fin("maxflow.in");
    int i,x,y,z;
    fin>>N>>M;
    //cout<<N<<" "<<M<<"\n";
    for(i=1;i<=M;i++)
    {
        fin>>x>>y>>z;
        C[x][y]+=z;
        G[x].pb(y);
        G[y].pb(x);
    }

    fin.close();
}

int main()
{

    cit();
    solve();
    fout.close();
    return 0;
}