#include <fstream>
#include <vector>
#include <queue>
#define inf 1e9
#define nmax 1001
using namespace std;
ifstream cin("maxflow.in");
ofstream cout("maxflow.out");
int n,m,x,y,c[nmax][nmax],flux[nmax][nmax],dp[nmax],ans;
queue<int>q;
vector<int>v[nmax];
bool bfs(int s,int d){
    for(int i=1;i<=n;i++)
        dp[i]=inf;
    dp[s]=0;
    q.push(s);
    while(!q.empty()){
        int nod=q.front();
        q.pop();
        for(auto i:v[nod])
            if(flux[nod][i]<c[nod][i]&&dp[i]>dp[nod]+1){
                dp[i]=dp[nod]+1;
                q.push(i);
            }
    }
    return dp[d]!=inf;
}
int dinic(int nod,int d,int f){
    if(f<=0)
        return 0;
    if(nod==d)
        return f;
    int r=0;
    for(auto i:v[nod])
        if(dp[nod]+1==dp[i]){
            /// in continuare pot trimite maxim cat permite muchia fie cat imi mai permit drumurile din spate
            int add=dinic(i,d,min(f-r,c[nod][i]-flux[nod][i]));
            r+=add;
            flux[nod][i]+=add;
            flux[i][nod]-=add;
        }
    return r;
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y>>c[x][y];
        v[x].push_back(y);
        v[y].push_back(x);
    }
    while(bfs(1,n))/// mai pot trimite flux
        ans+=dinic(1,n,inf);
    cout<<ans;
    return 0;
}