#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#define pb push_back
#define nmax 1001
#define inf 0x3f3f3f3f

using namespace std;

int dad[nmax], capacity[nmax][nmax], flow[nmax][nmax];
bool use[nmax];
vector<int> a[nmax];
queue<int> q;
int n, m, x, y, z;
int Q[nmax];
int floww, flowmin, node;
vector<int>::iterator it;

int bfs()
{
    vector<int>::iterator it;
    int node;

    for(int i=1; i<=n; ++i) use[i]=false;
    Q[0]=1; Q[1]=1;
    use[1]=true;

    for(int i=1; i<=Q[0]; ++i)
    {
        node=Q[i];
        if(node==n) continue;

        for(it=a[node].begin(); it!=a[node].end(); ++it)
        {
            if(capacity[node][*it]==flow[node][*it] || use[*it]) continue;
            use[*it]=true;
            Q[++Q[0]]=*it;
            dad[*it]=node;
        }

    }
    return use[n];
}

int main()
{
    freopen("maxflow.in", "rt", stdin);
    freopen("maxflow.out", "wt", stdout);

    scanf("%d%d", &n, &m);

    for(int i=1; i<=m; ++i)
    {
        scanf("%d%d%d", &x, &y, &z);
        capacity[x][y]+=z;

        a[x].pb(y);
        a[y].pb(x);
    }


    for(floww=0; bfs(); )
        for(it=a[n].begin(); it!=a[n].end(); ++it)
        {
            if(flow[*it][n]==capacity[*it][n] || !use[*it]) continue;

            dad[n]=*it;

            flowmin=inf;
            int NOD;
            for(NOD=n; NOD!=1; NOD=dad[NOD])
            flowmin=min(flowmin, capacity[dad[NOD]][NOD]-flow[dad[NOD]][NOD]);

            if(flowmin==0) continue;

            for(node=n; node!=1; node=dad[node])
            {
                flow[dad[node]][node]+=flowmin;
                flow[node][dad[node]]-=flowmin;
            }
            floww+=flowmin;
        }

    printf("%d", floww);
    return 0;
}