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

int N, M, cap[1002][1002], flow[1002][1002], prec[1002], x, y, c, sol, source, sink;
vector < int > G[1002];
queue < int > Q;

bool bfs(int source)
{
    Q.push(source);
    for (int i=1; i<=N; ++i)
        prec[i]=0; prec[source]=source;
    while (Q.size())
    {
        int nod=Q.front(); Q.pop();
        if (nod==sink) continue;
        vector <int>::iterator it=G[nod].begin();
        for (; it!=G[nod].end(); ++it)
            if (!prec[*it] && cap[nod][*it]>flow[nod][*it])
                prec[*it]=nod, Q.push(*it);
    }
    return (prec[sink]>0);
}

void maxflow(int source)
{
    while (bfs(source))
    {
        vector <int>::iterator it=G[sink].begin();
        for (; it!=G[sink].end(); ++it)
            if (prec[*it] && cap[*it][sink]>flow[*it][sink])
            {
                int minim=(1<<30); prec[sink]=*it;
                for (int x=sink; x!=source; x=prec[x])
                    if (cap[prec[x]][x]-flow[prec[x]][x]<minim)
                        minim=cap[prec[x]][x]-flow[prec[x]][x];
                if (minim>0)
                {
                    sol+=minim;
                    for (int x=sink; x!=source; x=prec[x])
                        flow[prec[x]][x]+=minim, flow[x][prec[x]]-=minim;
                }
            }
    }
}

int main()
{
    f>>N>>M; sink=N; source=1;
    for (int i=1; i<=M; ++i)
        f>>x>>y>>c, G[x].pb(y), G[y].pb(x), cap[x][y]+=c;

    maxflow(source);
    g<<sol<<'\n';
    return 0;
}