#include <bits/stdc++.h>

using namespace std;

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

int n,m;
int x,y,z;
int c[1005][1005],f[1005][1005];
int par[1005];

vector <int> g[1005];

bitset <1005> vis;

queue <int> q;

bool bfs()
{
    int i;
    for(i=1; i<=n; i++)
        vis[i]=0;
    q.push(1);
    vis[1]=1;
    while(!q.empty())
    {
        int node=q.front();
        q.pop();
        if(node==n)
            continue;
        for(auto u:g[node])
        {
            if(f[node][u]==c[node][u] || vis[u]==1)
                continue;
            vis[u]=1;
            q.push(u);
            par[u]=node;
        }
    }
    return vis[n];
}

int main()
{
    fin>>n>>m;
    int i;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>z;
        c[x][y]=z;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    long long flow;
    for(flow=0; bfs()==1;)
    {
        for(auto leaf:g[n])
        {
            if(f[leaf][n]==c[leaf][n] || !vis[leaf])
                continue;
            par[n]=leaf;
            int minFlow=(int)1e9;
            for(int node=n; node!=1; node=par[node])
            {
                int u=par[node];
                minFlow=min(minFlow,c[u][node]-f[u][node]);
            }
            if(minFlow==0)
                continue;
            for(int node=n; node!=1; node=par[node])
            {
                int u=par[node];
                f[u][node]+=minFlow;
                f[node][u]-=minFlow;
            }
            flow+=minFlow;
        }
    }
    fout<<flow<<"\n";
    return 0;
}