#include <fstream>
#include <vector>
#include <queue>
#define nmax 1010
#define INF 1<<30

using namespace std;

ifstream in("maxflow.in");
ofstream out("maxflow.out");

int N,M,S,D,flux;
vector<int> V[nmax];
queue<int> Q;
int T[nmax];
int C[nmax][nmax];//capacitatea maxima pe muchii
int F[nmax][nmax];//fluxul la momentul x

inline int minim(int a,int b){if(a<b)return a;return b;}

int BF()
{
    while(!Q.empty())Q.pop();
    int i,x,y;
    for(i=0;i<=N;i++)T[i]=0;
    T[S] = -1;
    Q.push(S);
    while(!Q.empty())
    {
        x = Q.front();
        Q.pop();
        for(i=0;i<V[x].size();i++)
        {
            y =V[x][i];
            if(C[x][y]>F[x][y]&&!T[y])//exista muchia
            {
                Q.push(y);
                T[y] = x;
                if(y==D)
                    return 1;
            }
        }
    }
    return 0;
}

int main()
{
    int x,y,c,muchie_minima;
    in>>N>>M;
    S=1,D=N;
    while(M--)
    {
        in>>x>>y>>c;
        C[x][y]+=c;
        V[x].push_back(y);
    }
    /*while(BF())
    {
        //am determinat un drum de la sursa la destinatie
        x = D;
        muchie_minima = INF;
        while(x!=S)
            muchie_minima = minim(muchie_minima,C[T[x]][x]-F[T[x]][x]),x=T[x];//determin costul minim
        //actualizez costurile
        x=D;
        while(x!=S)
            F[T[x]][x]+=muchie_minima,F[x][T[x]]-=muchie_minima,x=T[x];
        flux+=muchie_minima;
    }*/
    for (flux = 0; BF(); flux += muchie_minima)
	{
		muchie_minima = INF;
		for (x = N; x!= 1; x = T[x])
			muchie_minima = min(muchie_minima, C[ T[x] ][x] - F[ T[x] ][x]);
		for (x = N; x != 1; x = T[x])
		{
			F[ T[x] ][x] += muchie_minima;
			F[x][ T[x] ] -= muchie_minima;
		}
	}
    out<<flux;
    return 0;
}