#include <stdio.h>
#include <string.h>
#define MAXN 1000
#define MAXM 5000
#define source 1
#define terminal n
#define INF 300000

using namespace std;

struct edge
{
    int dest;
    int next;
    int cap;
    int coresp;
}g[2*MAXM];

struct parent_tracking
{
    int p;
    int index;
}parent[MAXN+1];

int n, m, first[MAXN+1], maxflow;
FILE *in, *out;

int mymin(int a, int b)
{
    if(a<b)
        return a;
    return b;
}

int BFS()
{
    int viz[MAXN+1], q[MAXN+1], p=0, u=0, vf, k;
    memset(viz, 0, sizeof(viz));
    q[p]=source;
    while(p<=u)
    {
        vf=q[p];
        k=first[vf];
        while(k!=-1)
        {
            if(viz[g[k].dest]==0 && g[k].cap>0)
            {
                u++;
                q[u]=g[k].dest;
                viz[g[k].dest]=1;
                parent[g[k].dest].p=vf;
                parent[g[k].dest].index=k;
            }
            k=g[k].next;
        }
        p++;
    }
    return viz[terminal];
}

int main()
{
    in = fopen("maxflow.in", "r");
    out = fopen("maxflow.out", "w");

    memset(first, -1, sizeof(first));

    fscanf(in, "%d%d", &n, &m);

    for(int i=0; i<m; i++)
        g[i].coresp=-1;

    for(int i=0; i<m; i++)
    {
        int x, y, c;
        fscanf(in, "%d%d%d", &x, &y, &c);
        g[i].dest=y;
        g[i].next=first[x];
        first[x]=i;
        g[i].cap=c;
    }

    int last=m-1;
    for(int i=1; i<=n; i++)
    {
        int k1, k2;
        k1=first[i];
        while(k1!=-1)
        {
            if(g[k1].coresp==-1)
            {
                k2=first[g[k1].dest];
                while(k2!=-1 && g[k2].dest!=i)
                    k2=g[k2].next;
                if(g[k2].dest==i)
                {
                    g[k1].coresp=k2;
                    g[k2].coresp=k1;
                }
                else
                {
                    last++;
                    g[last].dest=i;
                    g[last].next=first[g[k1].dest];
                    first[g[k1].dest]=last;
                    g[last].cap=0;
                    g[last].coresp=k1;
                    g[k1].coresp=last;
                }
            }
            k1=g[k1].next;
        }
    }

    maxflow=0;
    while(BFS())
    {
        int v=terminal, path_flow=INF;
        while(v!=source)
        {
            path_flow=mymin(path_flow, g[parent[v].index].cap);
            v=parent[v].p;
        }
        v=terminal;
        while(v!=source)
        {
            g[parent[v].index].cap-=path_flow;
            g[g[parent[v].index].coresp].cap+=path_flow;
            v=parent[v].p;
        }
        maxflow+=path_flow;
    }
    fprintf(out, "%d\n", maxflow);

    fclose(in);
    fclose(out);
    return 0;
}