#include<cstdio>
#include<vector>
#include<deque>
using namespace std;
const int nmax = 1005;
const int inf = (1<<31)-1;
int i,n,m,x,y,z,cap[nmax][nmax],flow[nmax][nmax],f[nmax],mf,sol;
vector<int> v[nmax];
deque<int> q;
bool bfs()
{
    for(i=2;i<=n;i++) f[i]=0;
    f[1]=1; q.push_back(1);
    while(!q.empty())
    {
        x=q.front(); q.pop_front(); if(x==n) continue;
        for(vector<int>::iterator it=v[x].begin();it!=v[x].end();it++)
            if(!f[*it] && flow[x][*it]<cap[x][*it])
            {
                f[*it]=x;
                q.push_back(*it);
            }
    }
    return f[n];
}
int main()
{
	freopen("maxflow.in","r",stdin);
	freopen("maxflow.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(;m;m--)
	{
	    scanf("%d%d%d",&x,&y,&z);
	    v[x].push_back(y);
	    v[y].push_back(x);
	    cap[x][y]=z;
	}
	while(bfs())
	{
        for(vector<int>::iterator it=v[n].begin();it!=v[n].end();it++)
            if(f[*it])
            {
                f[n]=*it; mf=inf;
                for(x=n;f[x]!=x;x=f[x])
                    mf=min(mf,cap[f[x]][x]-flow[f[x]][x]);
                for(x=n;f[x]!=x;x=f[x])
                {
                    flow[f[x]][x]+=mf;
                    flow[x][f[x]]-=mf;
                }
                sol+=mf;
            }
	}
	printf("%d\n",sol);
	return 0;
}