#include <fstream>
#include <queue>
#include <algorithm>
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");

int N, M, x, y, c, flux[1005][1005], cap[1005][1005], sol, dad[1005], D[1005], start=1, dest;
vector < int > G[1005];
queue < int > Q;

bool bfs(int sursa)
{
    for (int i=1; i<=N; ++i)
        D[i]=(1<<30);
    Q.push(sursa); D[sursa]=0;
    while (Q.size())
    {
        int nod=Q.front(); Q.pop();
        if (nod==dest) continue;
        vector<int>::iterator it=G[nod].begin();
        for (; it!=G[nod].end(); ++it)
            if (D[*it]>D[nod]+1 && cap[nod][*it]>flux[nod][*it])
            {
                D[*it]=D[nod]+1; dad[*it]=nod;
                Q.push(*it);
            }
    }
    return (D[dest]<(1<<30));
}

void go(int sursa)
{
    for (; bfs(sursa); )
    {
        vector<int>::iterator it=G[dest].begin();
        for (; it!=G[dest].end(); ++it)
            if (dad[dest]==*it)
            {
                int minim=(1<<30);
                for (int x=dest; x!=start; x=dad[x])
                    minim=min(minim, cap[dad[x]][x]-flux[dad[x]][x]);

                if (minim<(1<<30))
                {
                    for (int x=dest; x!=start; x=dad[x])
                        flux[dad[x]][x]+=minim, flux[x][dad[x]]-=minim;
                    sol+=minim;
                }
            }
    }
}

int main()
{
    f>>N>>M; dest=N;
    for (int i=1; i<=M; ++i)
    {
        f>>x>>y>>c;
        cap[x][y]=c;
        cap[y][x]=-c;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    go(1);
    g<<sol<<'\n';
    return 0;
}