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

using namespace std;

int cap[1005][1005], dad[1005], q[1005];
int n, Maxflow, m;
vector<int> v[1005];

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 dinic(int n,int s,int t)
{
    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;
           }
   }
   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;
   }
   printf("%d",dinic(n,1,n));
   return 0;
}