#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#define N 1024
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int n,m,x,y,z,C[N][N],F[N][N],flow,bf(),T[N],i,j,k;
vector<int> v[N];
queue<int> Q;
void upd();
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        f>>x>>y>>z;
        v[x].push_back(y);
        v[y].push_back(x);
        C[x][y]=z;
    }
    for(;;)
    {
        for(i=1;i<=n;i++)
            T[i]=0;
        T[1]=1;
        while(Q.size())Q.pop();
        Q.push(1);
        while(Q.size())
        {
            j=Q.front();
            Q.pop();
            for(auto it:v[j])
                if(!T[it]&&C[j][it]>F[j][it])
                {
                    T[it]=j;
                    Q.push(it);
                }

        }
        if(!T[n])break;
        for(k=1;k<n;k++)
            if(T[k]&&C[k][n]-F[k][n]>0)
            {
                int flux=C[k][n]-F[k][n];
                for(i=k,j=T[k];i!=j;i=T[i],j=T[j])
                    flux=min(flux,C[j][i]-F[j][i]);
                if(!flux)continue;
                F[k][n]+=flux;F[n][k]-=flux;
                for(i=k,j=T[k];i!=j;i=T[i],j=T[j])
                {
                    F[j][i]+=flux;
                    F[i][j]-=flux;
                }
                flow+=flux;
            }
    }
    g<<flow;
    return 0;
}