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

int C[1001][1001];//matricea costurilor
int n,m;
int T[1001];//vector TATA din BFS
vector<int> V[1001];//listele de adiacenta

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,sizeof(T));
    memset(X,0,sizeof(X));
    X[1] = 1;T[1]=-1;
    while(s<=d)
    {   i=X[s];
        for(j=0;j<V[i].size();j++)
        {
            int k=V[i][j];
            if(T[k]==0 && C[i][k]>0)
            {
                X[++d]=k;
                T[k]=i;
                if(k==n) return 1;
            }
        }
        s++;
    }
    return 0;
}

int flux_maxim()
{
    int i,minn,j,flux=0;
    while(BFS())//cat timp mai gaseste drumuri de crestere
      {
                minn=999999;
                j=n;
                while(j!=1)//calculeaza valoarea minima a drumului
                {
                    if(C[T[j]][j]<minn)
                        minn=C[T[j]][j];
                    j=T[j];
                }
                j=n;
                while(j!=1)//scade capacitatile pe drumul de crestere
                    {   C[T[j]][j]-=minn;
                        C[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;
        V[x].push_back(y);
        V[y].push_back(x);
    }
    fout<<flux_maxim();
    return 0;
}