#include <fstream>
#include <vector>
#include <cstring>
#define FOR(a,b,c) for(int a=b; a<=c; ++a)
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int n, m, c[2][1010], viz[1010], a[1010][1010], b[1010][1010], i, j, flx, x, y, z, nod;

vector<int> v[1010];

int bfs(){

    memset(viz,0,sizeof(viz));
    memset(c[1],0,sizeof(c[1]));
    int p=1, u=1;
    c[0][1]=1;
    c[1][1]=0;
    viz[1]=1;
    while(p<=u)
    {
        int x=v[ c[0][p] ].size()-1;
        FOR(i,0,x)
        {
            nod=v[c[0][p]][i];
            if(viz[nod]==0&&a[c[0][p]][nod]-b[c[0][p]][nod]>0)
            {
                c[0][++u]=nod;
                viz[nod]=1;
                c[1][nod]=c[0][p];

            }
        }
        p++;
    }
    return viz[n];
}

int main(){
    f>>n>>m;
    for(i=1; i<=m; i++)
    {
        f>>x>>y>>z;
        v[x].push_back(y);
        v[y].push_back(x);
        a[x][y]=z;

    }
    while(bfs())
    {
        for(i=0; i<v[n].size(); i++)
        {
            int vec=v[n][i];
            if(viz[vec]==0||a[vec][n]-b[vec][n]==0)
                continue;
            int Min= a[vec][n]-b[vec][n];
            if(Min==0)
                continue;
            nod=vec;
            while(c[1][nod])
            {
                Min=min(Min, a[c[1][nod]][nod]-b[c[1][nod]][nod]);
                nod=c[1][nod];
            }
            flx+=Min;
            b[vec][n]+=Min;
            b[n][vec]-=Min;
            nod=vec;
            while(c[1][nod])
            {
                b[c[1][nod]][nod]+=Min;
                b[nod][c[1][nod]]-=Min;
                nod=c[1][nod];
            }
        }
    }
    g<<flx<<"\n";
    return 0;
}