#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;
           }
   }
}

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;
   }
   while(1){
       memset(dad, -1, sizeof(dad));
       bfs();
       if(dad[n] == -1)
           break;
       for(int i = 1; i <= n; ++ i)
           if(Cap[i][n] && dad[i] != -1){
               int Min = Cap[i][n];
               for (int v = i, u = dad[v]; u > 0; v = u, u = dad[v])
                   Min = min(Min, Cap[u][v]);
               if(! Min)
                   continue;
               Cap[i][n] -= Min;
               Cap[n][i] += Min;
               for (int v = i, u = dad[v]; u >= 0; v = u, u = dad[v]){
                   Cap[u][v] -= Min;
                   Cap[v][u] += Min;
                }
               Maxflow += Min;
           }
   }
   printf("%d", Maxflow);
   return 0;
}