#include <bits/stdc++.h>

using namespace std;

ifstream f("maxflow.in");
ofstream g("maxflow.out");

int n,max_flow,viz[1010],tata[1010],flux[1010][1010],c[1010][1010];
vector <int> v[1010];
queue <int> q;

int fluxM()
{
    int i;

    /// reinitializam BF-ul
    for(i=1;i<=n;i++)viz[i]=0,tata[i]=0;
    q.push(1);viz[1]=1;

    while(!q.empty())
    {
        int nod=q.front();
        for(i=0;i<v[nod].size();i++)
        {
            int vecin=v[nod][i];
            if(viz[vecin]==0 && flux[nod][vecin]<c[nod][vecin])
            {
                /// il bifam indiferent, dar doar daca
                /// vecin este diferit de n facem relatia de tata

                viz[vecin]=1;
                if(vecin!=n)
                {
                    tata[vecin]=nod;
                    q.push(vecin);
                }
            }
        }
        q.pop();
    }

    if(viz[n]==0)return 0; /// inseamna ca nu mai gasim un nou drum

    /// luam "invers" toti vecinii lui n
    for(i=0;i<v[n].size();i++)
    {
        int nod=v[n][i];
        if(viz[nod]==1 && flux[nod][n]<c[nod][n])
        {
            /// parcurgem sa aflam minimul
            int flux_min=c[nod][n]-flux[nod][n];
            while(tata[nod]!=0)
            {
                flux_min=min(flux_min,c[tata[nod]][nod]-flux[tata[nod]][nod]);
                nod=tata[nod];
            }

            max_flow+=flux_min;

            /// parcurgem inca o data sa dam update la muchii
            nod=v[n][i];
            flux[nod][n]+=flux_min;
            flux[n][nod]-=flux_min;
            while(tata[nod]!=0)
            {
                flux[tata[nod]][nod]+=flux_min;
                flux[nod][tata[nod]]-=flux_min;
                nod=tata[nod];
            }
        }
    }

    return 1;
}

int m,i,x,y,cost;
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>cost;
        v[x].push_back(y);
        v[y].push_back(x);
        c[x][y]=cost;
        c[y][x]=0;
    }

    while(fluxM());
    g<<max_flow;
    return 0;
}