#define fisier "maxflow"
#include <fstream>
std::ifstream in(fisier ".in");
std::ofstream out(fisier ".out");
const int N = 1001, INF = 110000;
int C[N][N], T[N], n;
#include <vector>
std::vector<int> L[N];
#include <deque>
int bfs()
{
    int E[N] = {-1, INF};
    for (std::deque<int> D = {1}; D.size(); D.pop_front())
        for (int back: L[D.front()])
            if (not E[back] and C[D.front()][back])
            {
                D.push_back(back); ///
                E[back] = std::min(E[D.front()], C[D.front()][back]);
                T[back] = D.front();
                if (back == n)
                    return E[n];
            }
    return false;
}
int main()
{
    int m, min, f = 0;
    in >> n >> m;
    while (m--)
    {
        int a, b, c;
        in >> a >> b >> c;
        C[a][b] = c;
        L[a].push_back(b);
        L[b].push_back(a);
    }
    while (min = bfs())
    {
        f += min;
        for (int i = n; T[i]; i = T[i])
        {
            C[ T[i] ][i] -= min;
            C[i][ T[i] ] += min;
        }
    }
    out << f;
}