#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int nmax=1023,INF=1000000000;
int n,m;
vector<int>vec[nmax];
int q[nmax],t[nmax],vis[nmax],c[nmax][nmax],f[nmax][nmax];
int bfs()
{
    for(int i=1;i<=n;i++) vis[i]=0;
    vis[1]=1;
    q[0]=1;
    q[1]=1;
    for(int i=1;i<=q[0];i++)
    {
        if(q[i]==n) return 1;
        vector<int>::iterator it;
        for(it=vec[q[i]].begin();it!=vec[q[i]].end();++it)
        {
            if(vis[*it]==1||c[q[i]][*it]==f[q[i]][*it]) continue;
            vis[*it]=1;
            q[++q[0]]=*it;
            t[*it]=q[i];
        }
    }
    return 0;
}
void do_flow()
{
    int fmin=0,flow=0;
    for(flow=0;bfs();)
    {
        for(vector<int>::iterator it=vec[n].begin();it!=vec[n].end();++it)
        {
            if(!vis[*it]||c[*it][n]==f[*it][n]) continue;
            t[n]=*it;
            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;
            }
            flow+=fmin;
        }
    }
    printf("%d\n",flow);
}
int main()
{
    freopen ("maxflow.in","r",stdin);
    freopen ("maxflow.out","w",stdout);
    scanf("%d%d",&n,&m);
    int x,y,z;
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        vec[x].push_back(y);
        vec[y].push_back(x);
        c[x][y]+=z;
    }
    do_flow();
}