#include<stdio.h>
#include<vector>
#include<algorithm>
#include<queue>
#include<string.h>

#define x first
#define y second
#define NMAX 1007
#define INF 100000000

using namespace std;

int Cap[NMAX][NMAX], dad[NMAX], q[NMAX];
int n, Maxflow, m;

vector<int> v[NMAX];

void bfs(){
    int start = 0, avans = 0;
    q[avans++] = 1;
    dad[1] = -2;
    while(avans > start && dad[n] == -1){
        int Nod = q[start++];
        for(int i = 0; i < v[Nod].size(); ++ i)
            if(dad[v[Nod][i]] == -1 && Cap[Nod][v[Nod][i]] > 0){
                q[avans++] = v[Nod][i];
                dad[v[Nod][i]] = Nod;
            }
    }
    for(int j = 1; j <= n; j++)
        fprintf(stderr, "%d ", dad[j]);
    fprintf(stderr, "\n");
}

int main(){
    freopen("maxflow.in", "r", stdin);
    freopen("maxflow.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= m; ++i){
        int a = 0, b = 0, c = 0;
        scanf("%d %d %d", &a, &b, &c);
        v[a].push_back(b);
        v[b].push_back(a);
        Cap[a][b] += c;
    }
    memset(dad, -1, sizeof(dad));
    while(1){
        int Min = INF;
        bfs();
        if(dad[n] == -1)
            break;
        for(int i = 1; i <= n; ++ i)
            if(Cap[i][n] && dad[i] != -1){
                for(int Nod = i; Nod > 0; Nod = dad[Nod])
                    Min = min(Min, Cap[dad[Nod]][Nod]);
                if(! Min)
                    continue;
                Maxflow += Min;
                Cap[i][n] -= Min, Cap[n][i] += Min;
                for (int v = i, u = dad[v]; u >= 0; v = u, u = dad[v]){ fprintf(stderr, "%d ", v);
                    Cap[u][v] -= Min;  Cap[v][u] += Min;}
            }
        memset(dad, -1, sizeof(dad));
    }
    printf("%d", Maxflow);
    return 0;
}