#include<bits/stdc++.h>
#define maxN 1005
#define INF INT_MAX
using namespace std;
int n,c[maxN][maxN],f[maxN][maxN],m,x,y,z,flow,sol,tt[maxN];
vector<int> v[maxN];
bool seen[maxN];
deque<int> q;
bool bfs()
{
    for(int i=1;i<=n;i++) seen[i]=0;
    q.push_back(1);
    seen[1]=1;
    while(!q.empty())
    {
        int nod=q.front();
        for(vector<int>::iterator it=v[nod].begin();it!=v[nod].end();it++)
        {
            if(!seen[*it] && c[nod][*it]>f[nod][*it])
            {
                tt[*it]=nod;
                seen[*it]=1;
                q.push_back(*it);
            }
        }
        q.pop_front();
    }
    return seen[n];
}
int main()
{
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        c[x][y]=z;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    while(bfs())
    {
        for(vector<int>::iterator it=v[n].begin();it!=v[n].end();it++)
        {
        flow=c[*it][n]-f[*it][n];
        for(int t=*it;t>1;t=tt[t])
        {
            flow=min(flow,c[tt[t]][t]-f[tt[t]][t]);
        }
        f[*it][n]+=flow;
        f[n][*it]-=flow;
        for(int t=*it;t>1;t=tt[t])
        {
            f[tt[t]][t]+=flow;
            f[t][tt[t]]-=flow;
        }
        sol+=flow;
        }
    }
    printf("%d\n",sol);
    return 0;
}