#include<fstream>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
ifstream cin("maxflow.in");
ofstream cout("maxflow.out");

const int nmax=1024,inf=1000000000;
int n,m,i,j,c[nmax][nmax],f[nmax][nmax],x,y,z,p[nmax],V[nmax];
vector <int> g[nmax];

int bf()
{
    queue<int> q;
    q.push(1);
    memset(V,0,sizeof(V));
    memset(p,0,sizeof(p));
    V[1]=1;
    while (q.size())
    {
        int v=q.front(); q.pop();
        for (int k=0;k<g[v].size();k++)
          {
              int to=g[v][k];
              if (V[to] || f[v][to]==c[v][to]) continue;
              q.push(to);
              V[to]=1;
              p[to]=v;
              if (to==n) return 1;
          }
    }
    return 0;
}

int main()
{
    cin>>n>>m;
    for (i=1;i<=m;i++)
    {
        cin>>x>>y>>z;
        g[x].push_back(y);
        g[y].push_back(x);
        c[x][y]+=z;
    }


    int flow=0,mflow=0;
    for (; bf();flow+=mflow)
    {
        mflow=inf;
        for (j=n;j!=1;j=p[j])
            mflow=min(mflow,c[p[j]][j]-f[p[j]][j]);
        for (j=n;j!=1;j=p[j])
        {
            f[p[j]][j]+=mflow;
            f[j][p[j]]-=mflow;
        }
    }
    cout<<flow;
    return 0;
}