#include<fstream>
#include<cstring>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

int F[1001][1001];//matricea fluxurilor
int C[1001][1001];//matricea costurilor
int n,m;
int T[1001];//vector TATA din BFS

int BFS() //returneaza 1 daca gaseste drum de crestere de la 1 la n
{
    int s=1,d=1,j,i,X[1001];
    memset(T,0,1002);
    memset(X,0,1002);
    X[1] = 1;T[1]=-1;
    while(s<=d)
    {   i=X[s];
        for(j=1;j<=n;j++){
            if(T[j]==0 && C[i][j]>F[i][j])
            {
                X[++d]=j;
                T[j]=i;
                if(j==n) return 1;
            }
        }
        s++;
    }
    return 0;
}

int flux_maxim()
{
    int i,minn,j,flux=0;
    while(BFS())//cat timp mai gaseste drumuri de crestere
        for(i=1;i<=n;i++) //pt fiecare nod din drumul de crestere
            if(C[i][n]>F[i][n] && T[i]>0)
            {
                minn=C[i][n]-F[i][n];
                j=i;
                while(j!=1)//calculeaza valoarea minima a drumului
                {
                    if(C[T[j]][j] - F[T[j]][j]<minn)
                        minn=C[T[j]][j] - F[T[j]][j];
                    j=T[j];
                }
                if(minn)
                {
                    F[i][n]+=minn;//creste fulxul de la i la n
                    F[n][i]-=minn;// scade fluxul de la n la i
                    j=i;
                    while(j!=1)//modifica fluxurile pe drumul de crestere
                    {   F[T[j]][j]+=minn;
                        F[j][T[j]]-=minn;
                        j=T[j];
                    }
                    flux+=minn;//aduna minimul la fluxul maxim
                }
            }
    return flux;
}

int main()
{
    int i,x,y,c;
    fin>>n>>m;
    for(i=0;i<=m;++i)
    {
        fin>>x>>y>>c;
        C[x][y]=c;
    }
    fout<<flux_maxim();
    return 0;
}