using namespace std;
#include<iostream>
#include<fstream>
#include<vector>
#define pb push_back
#define nmax 1005
struct nod{
int lg,c;};
vector<nod> G[nmax];
int N,M;
int C[nmax][nmax],F[nmax][nmax];
int q[nmax],ante[nmax],viz[nmax];
ofstream fout("maxflow.out");

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

    }

    return viz[N];

}

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

            for(int i=it->lg;i!=1;i=ante[i])
            {
                fmin=min(fmin,C[ante[i]][i]-F[ante[i]][i]);

            }

            F[it->lg][N]+=fmin;
            F[N][it->lg]-=fmin;
            for(int i=it->lg;i!=1;i=ante[i])
            {
                F[ante[i]][i]+=fmin;
                F[i][ante[i]]-=fmin;
            }

            flow+=fmin;
        }
    }
    fout<<flow<<"\n";
}

void cit()
{
    ifstream fin("maxflow.in");
    int i,x,y,z;
    fin>>N>>M;
    for(i=1;i<=M;i++)
    {
        fin>>x>>y>>z;
        G[x].pb((nod){y,z});
        G[y].pb((nod){x,z});
        C[x][y]+=z;
        F[x][y]=F[y][x]=0;
    }

    fin.close();
}

int main()
{
    cit();

    solve();

    return 0;
}