#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
#define MAX 1010
#define INF 1<<30
typedef vector <int> :: iterator iter;
vector <int> G[MAX];

int F[MAX][MAX], C[MAX][MAX], n, viz[MAX], dad[MAX];
int nod;
queue <int> Q;

int bf()
{
    memset(viz, 0, sizeof(viz));
    Q.push(1);
    while(Q.size())
    {
        nod=Q.front();
        Q.pop();
        for(iter it=G[nod].begin();it!=G[nod].end();it++)
        {
            if(!viz[*it] && F[nod][*it]!=C[nod][*it])
            {
                dad[*it]=nod;
                viz[*it]=1;
                if(*it!=n)
                    Q.push(*it);
            }
        }
    }
    return viz[n];
}


int main()
{
    int m, x, y;
    fin>>n>>m;
    while(m--)
    {
        fin>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
        fin>>C[x][y];
    }
    int minim, i, flow=0;
    while(bf())
    {
        for(iter it=G[n].begin();it!=G[n].end();it++)
        {
            dad[n]=*it;
            if(!viz[*it] || F[*it][n]==C[*it][n])
                continue;
            minim=INF;
            for(i=n;i!=1;i=dad[i])
            {
                minim=min(minim, C[dad[i]][i]-F[dad[i]][i]);
            }
            for(i=n;i!=1;i=dad[i])
            {
                F[i][dad[i]]-=minim;
                F[dad[i]][i]+=minim;
            }
            flow+=minim;
        }
    }
    fout<<flow<<"\n";
}