#include <bits/stdc++.h>
using namespace std;
#if 1
#define pv(x) cout<<#x<<" = "<<(x)<<"; ";cout.flush()
#define pn cout<<endl
#else
#define pv(x)
#define pn
#endif
#ifdef INFOARENA
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
#else
#define in cin
#define out cout
#endif
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
#define pb push_back
#define mp make_pair
const int NMax = 2e3 + 5;
const ll inf_ll = 1e18 + 5;
const int inf_int = 1e9 + 5;
const int mod = 100003;
using zint = int;
int dad[NMax], cap[NMax][NMax], flow[NMax][NMax];
vector<int> v[NMax];
bool bfs(int N) {
memset(dad, 0, sizeof(dad));
queue<int> Q;
Q.push(1);
dad[1] = 1;
while (Q.size()) {
int node = Q.front(); Q.pop();
if (node == N) {
return true;
}
for (int nxt : v[node]) {
if (flow[node][nxt] == cap[node][nxt] || dad[nxt] != 0) {
continue;
}
Q.push(nxt);
dad[nxt] = node;
}
}
return false;
}
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
int N,M;
in >> N >> M;
for (int i = 1; i <= M; ++i) {
int x,y,c;
in >> x >> y >> c;
if (cap[x][y] == 0 && cap[y][x] == 0) {
v[x].pb(y);
v[y].pb(x);
}
cap[x][y] += c;
}
int maxFlow = 0;
while (bfs(N)) {
int node = N;
int minFlow = inf_int;
while (node != 1) {
minFlow = min(minFlow, cap[dad[node]][node] - flow[dad[node]][node]);
node = dad[node];
}
node = N;
while (node != 1) {
flow[dad[node]][node] += minFlow;
flow[node][dad[node]] -= minFlow;
node = dad[node];
}
maxFlow += minFlow;
}
out << maxFlow << '\n';
return 0;
}