#include <cstdio>
#include <vector>
#include <queue>
#define pb push_back
using namespace std;
const int nmax=1004;
queue<int>q;
vector<int>adj[nmax];
int vis[nmax],t[nmax];
int f[nmax][nmax],c[nmax][nmax];
int n,m;
inline void citire()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        int x,y,z;
        scanf("%d%d%d",&x,&y,&z);
        adj[x].pb(y);
        adj[y].pb(x);
        c[x][y]+=z;
    }
}
int bfs()
{
    for(int i=1;i<=n;i++) vis[i]=0;
    q.push(1);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        if(nod==n)
        {
            while(!q.empty()) q.pop();
            return 1;
        }
        for(vector<int>::iterator it=adj[nod].begin();it!=adj[nod].end();++it)
        {
            if(vis[*it]||f[nod][*it]==c[nod][*it]) continue;
            vis[*it]=1;
            t[*it]=nod;
            q.push(*it);
        }
    }
    return 0;
}
inline void do_flow()
{
    int flow=0,fmin;
    for(fmin=0;bfs();)
    {
        for(vector<int>::iterator it=adj[n].begin();it!=adj[n].end();++it)
        {
            if(!vis[*it]||c[*it][n]==f[*it][n]) continue;
            t[n]=*it;
            fmin=0x3f3f3f3f;
            for(int nod=n;nod!=1;nod=t[nod]) fmin=min(fmin,c[t[nod]][nod]-f[t[nod]][nod]);
            for(int nod=n;nod!=1;nod=t[nod])
            {
                f[nod][t[nod]]-=fmin;
                f[t[nod]][nod]+=fmin;
            }
            flow+=fmin;
        }
    }
    printf("%d\n",flow);
}
int main()
{
    freopen ("maxflow.in","r",stdin);
    freopen ("maxflow.out","w",stdout);
    citire();
    do_flow();
}