#include <fstream>
#include <vector>
#include <string.h>
#define nMax 1028
#define INF 1 << 30
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int viz[nMax], C[nMax][nMax], nod, V, a, b, c, i, flow, fmin, F[nMax][nMax], q[nMax], TT[nMax], n, m;
vector<int> G[nMax];
int BF()
{
    memset(viz, 0, sizeof(viz));
    q[0]=q[1]=viz[1]=1;
    for(i=1;i<=q[0];i++)
    {
        nod=q[i];
        if(nod==n)
            continue;
        for(int j=0; j<G[nod].size(); j++)
        {
            V=G[nod][j];
            if(C[nod][V]==F[nod][V] || viz[V])
                continue;
            q[++q[0]]=V;
            TT[V]=nod;
            viz[V]=1;
        }
    }
    return viz[n];
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        G[a].push_back(b);
        G[b].push_back(a);
        C[a][b]+=c;
    }
    for(flow=0;BF();)
        for(i=0;i<G[n].size();i++)
        {
            nod=G[n][i];
            if(F[nod][n]==C[nod][n] || !viz[nod])
                continue;
            TT[n]=nod;
            fmin=INF;
            for(nod=n; nod!=1; nod=TT[nod])
                fmin=min(fmin, C[TT[nod]][nod]-F[TT[nod]][nod]);
            if(fmin==0)
                continue;
            for(nod=n; nod!=1; nod=TT[nod])
            {
                F[TT[nod]][nod]+=fmin;
                F[nod][TT[nod]]-=fmin;
            }
            flow+=fmin;
        }
    fout<<flow;
    return 0;
}