#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

const int inf=1000000000;
vector<int> v[1010];
queue<int> q;
int cap[1010][1010],flow[1010][1010],tata[1010],sursa,dest;
char vaz[1010];

int bfs()
{
    for(int i=sursa;i<=dest;i++) vaz[i]=0;
    q.push(sursa);
    vaz[sursa]=1;
    while(!q.empty())
    {
        int nod=q.front();q.pop();
        for(vector<int>::iterator it=v[nod].begin();it!=v[nod].end();it++)
            if(!vaz[*it] && cap[nod][*it]>flow[nod][*it])
            {
                vaz[*it]=1;
                tata[*it]=nod;
                q.push(*it);
            }
    }
    return vaz[dest];
}

int main()
{
    freopen("maxflow.in", "r", stdin);
    freopen("maxflow.out", "w", stdout);
    int n,m,x,y,c,sol=0;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        v[x].push_back(y);
        cap[x][y]+=c;
    }
    sursa=1;dest=n;
    while(bfs())
    {
        int s=inf;
        for(int i=dest;i!=sursa;i=tata[i]) s=min(s,cap[tata[i]][i]-flow[tata[i]][i]);
        for(int i=dest;i!=sursa;i=tata[i])
        {
            flow[tata[i]][i]+=s;
            flow[i][tata[i]]-=s;
        }
        sol+=s;
    }
    printf("%d",sol);
    return 0;
}