using namespace std;
#include<iostream>
#include<fstream>
#include<vector>
#include<cstring>
#define oo 0x3f3f3f3f
#define pb push_back
#define nmax 1005
int viz[nmax];
vector<int> G[nmax];
int C[nmax][nmax];
int F[nmax][nmax];
int N,M;
int q[nmax];
int ante[nmax];
ofstream fout("maxflow.out");

bool BFS()
{   vector<int>::iterator it;
    int u;
    memset(q,0,sizeof(q));
    memset(viz,0,sizeof(viz));
    int front=1;
    viz[1]=1;
    q[++q[0]]=1;
    while(front<=q[0])
    {
        u=q[front++];
        for(it=G[u].begin();it<G[u].end();it++)
        {
            if(!viz[*it] && C[u][*it]>F[u][*it])
            {
                viz[*it]=1;
                ante[*it]=u;
                q[++q[0]]=*it;
            }
        }

    }
    return viz[N];

}

void solve()
{
    int i,fmin,flow;
    vector<int>::iterator it;
    for(flow=0;BFS();)
    {
        fmin=oo;
        for(it=G[N].begin();it<G[N].end();it++)
        if(viz[*it] && 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;
        G[x].pb(y);
        G[y].pb(x);
        C[x][y]+=z;
        F[x][y]=F[y][x]=0;
    }

    fin.close();
}

int main()
{

    cit();

    solve();
    fout.close();
    return 0;
}