#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#define x first
#define y second
#define mp make_pair
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int i,j,n,m,p[1005],a,b,c[1001][1001],nod,ok,mini;
long long int flow;
vector <int > v[1005];
bool bfs()
{
   queue<int> q;
   q.push(1);
   p[1] = -1;
   int i;
   while(q.size())
   {
       nod = q.front(),q.pop();
       for(i = 0; i < v[nod].size(); i++)
       {
           int nxt = v[nod][i];
           if(p[nxt] == 0 && c[nod][nxt])
           {
               p[nxt] = nod;
               if(nxt == n)
                    break;
               else
                    q.push(nxt);
           }
       }
   }
   if(!p[n])
        return 0;
    mini = c[p[n]][n];
    for(i = p[n]; i>1; i = p[i])
        mini = min(mini, c[p[i]][i]);
    for(i = p[n]; i>1; i = p[i])
    {
         c[p[i]][i]-=mini;
         c[i][p[i]]+=mini;
    }
    flow += mini;
    c[p[n]][n] -= mini;
    return 1;
}
int main()
{
    fin >> n >> m;
    for(i = 1; i <= m; i++)
    {
        fin >> a >> b >> j;
        v[a].push_back(b);
        v[b].push_back(a);
        c[a][b] = j;
    }
    while(bfs())
    {
        memset(p,0,sizeof(p));
    }
    fout<<flow;
return 0;
}