using namespace std;
#include<iostream>
#include<fstream>
#include<vector>
#include<cstring>
#define oo 0x3f3f3f3f
#define nmax 1005
#define pb push_back
vector<int> G[1005];
ofstream fout("maxflow.out");
int C[nmax][nmax];
int F[nmax][nmax];//<<====what?

int viz[nmax];
int ante[nmax];
int N,M;

bool BFS()
{int u;
    vector<int>::iterator it;
    int q[nmax];
    memset(viz,0,sizeof(viz));
    viz[1]=1;
    q[0]=0;
    q[++q[0]]=1;

    int front=1;
    while(front<=q[0])
    {
        u=q[front++];
        for(it=G[u].begin();it<G[u].end();++it)
        {
            if(viz[*it]==0)
              if(F[u][*it]<C[u][*it])
              {
                  viz[*it]=1;
                  ante[*it]=u;
                  q[++q[0]]=*it;
              }
        }
    }


    return viz[N];
}


void solve()
{int i, flow,fmin;
vector<int>::iterator it;
for(flow=0;BFS();)
{
    fmin=oo;
    for(it=G[N].begin();it!=G[N].end();it++)
    {
        if(viz[*it]==1 && C[*it][N]>0)
        {
            fmin=C[*it][N]-F[*it][N];

            for(i=*it;i!=1;i=ante[i])
                fmin=min(fmin,C[ante[i]][i]-F[ante[i]][i]);

            F[*it][N]+=fmin;
            F[N][*it]-=fmin;

            for(i=*it;i!=1;i=ante[i])
            {
                F[ante[i]][i]+=fmin;
                F[i][ante[i]]-=fmin;
            }

            flow+=fmin;
        }

    }

}
     fout<<flow<<"\n";
}


void cit()
{int i,x,y,z;
    ifstream fin("maxflow.in");
    fin>>N>>M;
    for(i=1;i<=M;i++)
    {
        fin>>x>>y>>z;
        C[x][y]+=z; //nu ca as avea mai multe edge-uri
        F[y][x]=0;
        G[x].pb(y);
        G[y].pb(x);
    }
    fin.close();
}

int main()
{
    cit();

    solve();

    fout.close();
    return 0;

}