#include <cstdio>
#include <cstring>
#include <vector>

using namespace std;

#define MAX_N 1001
#define INF 0x3f3f3f3f

vector<int> G[1001];
int N , M , S , D , C[MAX_N][MAX_N] , F[MAX_N][MAX_N] , T[MAX_N] , flow;
int cd[MAX_N],  viz[MAX_N];

static inline int min(int a,int b)
{
	return a < b ? a : b ;
}

int BF()
{
	int i, j, nod, V;

	cd[0] = 1;
	cd[1] = 1;
	memset(viz, 0, sizeof(viz));
	viz[1] = 1;

	for (i = 1; i <= cd[0]; i++)
	{
		nod = cd[i];
                if (nod == N) continue;
		for (j = 0; j < (int)G[nod].size(); j++) 
			{
				V = G[nod][j];
				if (C[nod][V] == F[nod][V] || viz[V]) continue;
				viz[V] = 1;
				cd[ ++cd[0] ] = V;
				T[V] = nod;
			}
	}

	return viz[N];
}


void flux_maxim()
{int i , j , nod , fmin;
	for (flow = 0; BF();)
		for (i = 0; i <(int) G[N].size(); i++)
		{
			nod = G[N][i];
			if (F[nod][N] == C[nod][N] || !viz[nod]) continue;
			T[N] = nod;
			
			fmin = INF;
			for (nod = N; nod != 1; nod = T[nod]) 
				fmin = min(fmin, C[ T[nod] ][nod] - F[ T[nod] ][nod]);
			if (fmin == 0) continue;
			
			for (nod = N; nod != 1; nod = T[nod])
			{
				F[ T[nod] ][nod] += fmin;
				F[nod][ T[nod] ] -= fmin;
			}
			flow += fmin;
		}
}


int main()
{
	freopen("maxflow.in","r",stdin);
	freopen("maxflow.out","w",stdout);
	scanf("%d %d",&N,&M);
	for(int x,y,z;M;M--)
	{
		scanf("%d %d %d",&x,&y,&z);
		C[x][y]+=z;
		G[x].push_back(y);
		G[y].push_back(x);
	}
	flux_maxim();
	printf("%d",flow);
	return 0;
}