#include <cstdio>
#include <vector>
#define pb push_back
#define NMAX 1023
#define INF 1000000000
using namespace std;
int n,m;
int vis[NMAX],t[NMAX],C[NMAX][NMAX],F[NMAX][NMAX],q[NMAX];
vector<int>v[NMAX];
int bfs()
{
    for(int i=1;i<=n;i++) vis[i]=0;
    q[0]=1;
    q[1]=1;
    for(int i=1;i<=q[0];i++)
    {
        int nod=q[i];
        vector<int>::iterator it;
        for(it=v[nod].begin();it!=v[nod].end();++it)
        {
            if(vis[*it]||C[nod][*it]==F[nod][*it]) continue;
            t[*it]=nod;
            vis[*it]=1;
            q[++q[0]]=*it;
            if(*it==n) return 1;
        }
    }
    return 0;
}
inline void read()
{
    scanf("%d%d",&n,&m);
    int x,y,z;
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        v[x].pb(y);
        v[y].pb(x);
        C[x][y]+=z;
    }
}
inline void solve_flow()
{
    int flow=0,fmin=0;
    for(flow=0;bfs();flow+=fmin)
    {
        fmin=INF;
        for(int i=n;i!=1;i=t[i]) fmin=min(fmin,C[t[i]][i]-F[t[i]][i]);
        for(int i=n;i!=1;i=t[i])
        {
            F[t[i]][i]+=fmin;
            F[i][t[i]]-=fmin;
        }
    }
    printf("%d\n",flow);
}
int main()
{
    freopen ("maxflow.in","r",stdin);
    freopen ("maxflow.out","w",stdout);
    read();
    solve_flow();
}