#include<cstdio>
#include<queue>
#define MAX_N 1000
using namespace std;

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

node *L[MAX_N + 1];
int c[MAX_N+1][MAX_N+1], f[MAX_N+1][MAX_N+1], n, m, S, D, flow;
int T[MAX_N+1];

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

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

void MaxFlow()
{
    int drum, minim, Node;
    node* p;
    drum = BFS(S);
    while(drum)
    {
        p = L[D];
        while(p != NULL)
        {
            if(T[p->val] && c[p->val][D] > f[p->val][D])
            {
                T[D] = p->val;
                minim = 0x7fffffff;
                for(Node = D; Node != S; Node = T[Node])
                    if(minim > c[T[Node]][Node] - f[T[Node]][Node])
                        minim = c[T[Node]][Node] - f[T[Node]][Node];
                if(minim > 0)
                {
                    flow += minim;
                    for(Node = D; Node != S; Node = T[Node])
                    {
                        f[T[Node]][Node] += minim;
                        f[Node][T[Node]] -= minim;
                    }
                }
            }
            p = p->next;
        }
        drum = BFS(S);
    }
}

int main()
{
    int x, y, cap, i;
    FILE *fin, *fout;
    fin =fopen("maxflow.in","r");
    fout = fopen("maxflow.out","w");
    fscanf(fin,"%d%d",&n,&m);
    for(i=1; i<=m; i++)
    {
        fscanf(fin,"%d%d%d",&x,&y,&cap);
        Insert(x,y);
        Insert(y,x);
        c[x][y] = cap;
    }
    S = 1; D = n;
    MaxFlow();
    fprintf(fout,"%d\n",flow);
    fclose(fin);
    fclose(fout);
    return 0;
}