#include <fstream>
#include <vector>
#include <queue>
using namespace std;

const int inf=1<<30;

int bfs(const vector<vector<int > >&adj,vector<vector<int> >&cap,vector<int>&tav,int n,int start,int fin)
{
    fill(tav.begin(),tav.end(),-1);
    queue<pair<int,int> >q;
    q.push({start,inf});
    tav[start]=-2;
    while(!q.empty()){
        int v=q.front().first;
        int flow=q.front().second;
        q.pop();
        for(int sz:adj[v])
        {
            if(tav[sz]==-1 && cap[v][sz])
            {
                tav[sz]=v;
                int new_flow=min(flow,cap[v][sz]);
                if(sz==fin)
                    return new_flow;
                q.push({sz,new_flow});
            }
        }
    }
    return 0;
}

int maxflow(vector<vector<int> >&adj,vector<vector<int> >&cap,int n,int start,int fin)
{
    int t_flow=0;
    vector<int>tav(n+1,-1);
    int new_flow;
    while(new_flow=bfs(adj,cap,tav,n,start,fin))
    {
        t_flow+=new_flow;
        int curr=fin;
        while(curr!=start)
        {
            int prev=tav[curr];
            cap[curr][prev]+=new_flow;
            cap[prev][curr]-=new_flow;
            curr=prev;
        }
    }
    return t_flow;
}


int main()
{
    ifstream be("maxflow.in");
    ofstream ki("maxflow.out");
    int n,m;
    be>>n>>m;
    vector<vector<int>>adj(n+1,vector<int>(n+1));
    vector<vector<int> >cap(n+1,vector<int>(n+1,0));
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        be>>x>>y>>c;
        adj[x].push_back(y);
        adj[y].push_back(x);
        cap[x].push_back(y);
        cap[x][y]=c;

    }


    ki<<maxflow(adj,cap,n,1,n);

    return 0;
}