#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], Flux[NMAX][NMAX], q[NMAX], dad[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]] - Flux[Nod][v[Nod][i]] > 0){
               q[avans++] = v[Nod][i];
               dad[v[Nod][i]] = Nod;
           }
   }
}

inline int father(int Nod, int Min){
    if(Nod == 1)
        return Min;
    int Dad = dad[Nod];
    Min = min(Min, Cap[Dad][Nod] - Flux[Dad][Nod]);
    return father(dad[Nod], Min);
}

void father2(int Nod, int Min){
    if(Nod == 1)
        return;
    int Dad = dad[Nod];
    Flux[Nod][Dad] -= Min;
    Flux[Dad][Nod] += Min;
    father2(dad[Nod], Min);
}

inline int fluxmax(){
    while(1){
        memset(dad, -1, sizeof(dad));
        bfs();
        if(dad[n] == -1)
            return Maxflow;
        for(int i = 1; i <= n; ++ i)
            if(Cap[i][n] && dad[i] != -1){
                int Min = INF;
                Min = father(i, Min);
                if(! Min)
                    continue;
                Maxflow += Min;
                father2(i, Min);
            }
    }
    return Maxflow;
}

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;
        Flux[a][b] = 0;
    }
    printf("%d", fluxmax());
    return 0;
}