#include<bits/stdc++.h>
using namespace std;
ifstream in("maxflow.in");
ofstream out("maxflow.out");
vector<vector<int>>muchii(1001,vector<int>());
long long val[1001][1001];
int tata[1001];
int n,m;
bool bfs()
{queue<int>q;
for(int i=2;i<=n;i++)
  tata[i]=0;
bool ok=0;
q.push(1);
while(!q.empty())
{int x=q.front();
q.pop();
    for(auto k:muchii[x])
{if(val[x][k]==0||tata[k])continue;
if(k!=n)
{tata[k]=x;
 q.push(k);}
 else
    ok=1;
}

}
return ok;
}

int main()
{in>>n>>m;
long long max_flow=0;
for(int i=1;i<=m;i++)
    {int x,y,z;
    in>>x>>y>>z;
    val[x][y]+=1ll*z;
    muchii[x].push_back(y);
    muchii[y].push_back(x);
}
tata[1]=1;
while(bfs())
{
    for(auto x:muchii[n])
        if(val[x][n])
    {int ok=1;
        int fiu=x,tatal=tata[x];
long long vmin=1e16;
while(fiu!=1&&ok)
{vmin=min(vmin,val[tatal][fiu]);
if(val[tatal][fiu]<=0)ok=0;
fiu=tatal;
tatal=tata[tatal];
}
if(ok)
{max_flow+=vmin;

 fiu=x,tatal=tata[x];
 while(fiu!=1)
 {val[tatal][fiu]-=vmin;
 val[fiu][tatal]+=vmin;
     fiu=tatal;
tatal=tata[tatal];
 }


}}
}
out<<max_flow;
}