#include <iostream>
#include <string.h>
#include <random>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <iomanip>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <complex>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, string> pis;
typedef pair<string, string> pss;
typedef pair<int, char> pic;
typedef pair<pii, int> piii;
typedef pair<double, double> pdd;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ull, ull> pull;
typedef complex<double> cd;
//#define max(n, m) ((n>m)?n:m)
//#define min(n, m) ((n<m)?n:m)
#define f first
#define s second
#define input() ios_base::sync_with_stdio(0);cin.tie(0);

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

struct edge
{
    int nx, cap, cur;
};

vector<edge> adj[1010];
vector<edge> rev[1010];
queue<pii> nextInLine;
bitset<1010> visited;
vector<pii> ord;
int cur[1010][1010];
int main()
{
    int n, m, a, b, c, curN, curF, ans = 0;
    fin >> n >> m;
    for(int i = 0; i < m; i ++)
    {
        fin >> a >> b >> c; a--; b--;
        if(b == 0 || a == n-1) swap(a, b);
        adj[a].push_back({b, c, 0});
        if(a != 0 && b != n-1) rev[b].push_back({a, c, 0});
    }
    for(int i = 0; i < m; i ++)
    {
        nextInLine.push({0, 2000000000});
        visited.reset(); ord.clear();
        while(!nextInLine.empty())
        {
            curN = nextInLine.front().f; curF = nextInLine.front().s;
            nextInLine.pop();
            if(visited[curN]) continue;
            visited[curN] = true;
            for(int i = 0; i < adj[curN].size(); i ++)
            {
                edge it = adj[curN][i];
                if(cur[curN][it.nx] < it.cap && cur[curN][it.nx] >= 0)
                {
                    nextInLine.push({it.nx, min(curF, it.cap-cur[curN][it.nx])});
                    ord.push_back({curN, it.nx});
                    break;
                }
            }
            if(ord.size() == visited.count()) continue;
            for(int i = 0; i < rev[curN].size(); i ++)
            {
                edge it = rev[curN][i];
                if(cur[curN][it.nx] > -it.cap)
                {
                    nextInLine.push({it.nx, min(curF, cur[curN][it.nx]+it.cap)});
                    ord.push_back({curN, -(it.nx+1)});
                }
            }
        }
        for(int i = 0; i < ord.size(); i ++)
        {
            if(ord[i].s >= 0) cur[ord[i].f][ord[i].s] += curF, cur[ord[i].s][ord[i].f] += curF;
            else cur[ord[i].f][(-ord[i].s)-1] -= curF, cur[(-ord[i].s)-1][ord[i].f] -= curF;
        }
    }
    for(int i = 0; i < n; i++)
        for(auto it : adj[i])
            if(it.nx == n-1)
                ans += cur[i][it.nx];
    fout << ans << "\n";
}