#include<cstdio>
#include<queue>
#define NMAX 1002
using namespace std;

int c[NMAX][NMAX], f[NMAX][NMAX], T[NMAX], n, m, S, D, flux;

struct nod
{
    int val;
    nod *next;
};

nod *L[NMAX];

inline void add(int x, int y)
{
    nod *elem = new nod;
    elem->val = y;
    elem->next = L[x];
    L[x] = elem;
}

bool BFS(int x)
{
    int i, Nod, v;
    nod *p;
    bool ok;
    queue <int> Q;
    for(i=1; i<=n; i++)
        T[i] = 0;
    T[x] = -1;
    Q.push(x);
    ok = 0;
    while(!Q.empty())
    {
        Nod = Q.front();
        Q.pop();
        p = L[Nod];
        while(p != NULL)
        {
            v = p->val;
            if(!T[v] && c[Nod][v] > f[Nod][v])
            {
                if(v != D)
                {
                    T[v] = Nod;
                    Q.push(v);
                }
                else ok = 1;
            }
            p = p->next;
        }
    }
    return ok;
}

void MaxFlow()
{
    int minim, drum, v, Nod;
    nod *p;
    drum = BFS(S);
    while(drum)
    {
        p = L[D];
        while(p != NULL)
        {
            v = p->val;
            if(T[v] && c[v][D] > f[v][D])
            {
                T[D] = v;
                minim = 0x7fffffff;
                for(Nod=D; Nod!=S; Nod=T[Nod])
                    if(minim > c[T[Nod]][Nod] - f[T[Nod]][Nod])
                        minim = c[T[Nod]][Nod] - f[T[Nod]][Nod];

                if(minim >=0)
                    flux+=minim;

                for(Nod=D; Nod!=S; Nod=T[Nod])
                {
                    f[T[Nod]][Nod]+=minim;
                    f[Nod][T[Nod]]-=minim;
                }

            }
            p = p->next;
        }
        drum = BFS(S);
    }
}


void Read()
{
    int i, a, b;
    FILE *fin = fopen("maxflow.in","r");
    fscanf(fin,"%d%d",&n,&m);
    for(i=1; i<=m; i++)
    {
        fscanf(fin,"%d%d",&a,&b);
        fscanf(fin,"%d",&c[a][b]);
        add(a,b);
        add(b,a);
    }
    fclose(fin);
}

int main()
{
    FILE *fout = fopen("maxflow.out","w");
    Read();
    S = 1;
    D = n;
    MaxFlow();
    fprintf(fout,"%d\n",flux);
    fclose(fout);
    return 0;
}