#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <queue>
using namespace std;
vector<int> G[1005];
int F[1005][1005],C[1005][1005],flux,x,y,r;
vector <int> T;
int n,m;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
bool BF()
{
    queue <int> q;
    T=vector<int>(n+1,0);
    T[1]=-1;
    q.push(1);
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        for(auto x:G[u])
            if(!T[x] && C[u][x]>F[u][x])
            {
                q.push(x);
                T[x]=u;
                if(x==n)
                    return true;
            }
    }
    return false;
}
int main()
{
    f>>n>>m;
    while(m--)
    {
        int a,b;
        f>>a>>b;
        f>>C[a][b];
        //C[b][a]=C[a][b];
        G[a].push_back(b);
        G[b].push_back(a);
    }
    while(BF())
        for(auto u : G[n])
        {
            //if(T[u]==-1 || C[u][n]<=F[u][n])continue;
            r=C[u][n]-F[u][n];
            for(int j=u; j>1; j=T[j])
                r=min(r,C[T[j]][j]-F[T[j]][j]);
            if(!r)
                continue;
            F[u][n]+=r;
            F[n][u]-=r;
            for(int j=u; j>1; j=T[j])
                F[T[j]][j]+=r,F[j][T[j]]-=r;
            flux+=r;
        }
    g<<flux;
}