#include <cstdio>
#include <vector>
#include <bitset>
#include <queue>
#include <cstring>

#define NMAX 1005
#define INF 0x3f3f3f3f

using namespace std;

queue <int>q;
bitset <NMAX>ap;
vector <int>v[NMAX];

int n,m,x,y,z,flow;
int boss[NMAX],cap[NMAX][NMAX];

inline bool df()
{
    for (;!q.empty();q.pop());
    q.push(1);
    while (!q.empty())
    {
       int nod=q.front();
       q.pop();
       for (auto it:v[nod])
        if (!ap[it] && cap[nod][it])
        {
          ap[it]=1;
          boss[it]=nod;
          if (it==n)return 1;
          q.push(it);
        }
    }
   return 0;
}
int main()
{
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);

    scanf ("%d %d",&n,&m);

    for (;m;m--)
    {
        scanf("%d %d %d",&x,&y,&z);

        v[x].push_back(y);
        v[y].push_back(x);
        cap[x][y]+=z;
    }
    ap[1]=1;
    while (df())
    {
        int maxflow=INF;
        for (int i=n;i!=1;i=boss[i])
          maxflow=(maxflow>cap[boss[i]][i]?cap[boss[i]][i]:maxflow);
        for (int i=n;i!=1;i=boss[i])
          cap[boss[i]][i]-=maxflow,
          cap[i][boss[i]]+=maxflow;
        flow+=maxflow;
        for (int i=2;i<=n;i++)ap[i]=0;
    }
    printf("%d",flow);

    fclose(stdin);
    fclose(stdout);
}