using namespace std;
#include<iostream>
#include<fstream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#define oo 0x3f3f3f3f;
#define pb push_back
#define nmax 1005
#define mmax 3505
struct edge{
int x,y;};
vector<int> G[nmax];
int N,M;
edge a[mmax];
int F[nmax][nmax], C[nmax][nmax];
int ante[nmax];
int viz[nmax];
int q[nmax];
int flow;
//ofstream fout("sabotaj.out");
ofstream fout("maxflow.out");

bool BFS(int sink)
{
    memset(viz,0,sizeof(viz));
    //memset(ante,0,sizeof(ante));
    memset(q,0,sizeof(q));
    viz[1]=1;
    q[++q[0]]=1;
    int front=1;
    int u;
    vector<int>::iterator it;
    while(front<=q[0])
    {
        u=q[front++];
        for(it=G[u].begin();it<G[u].end();it++)
        {
            if(!viz[*it] && C[u][*it]>F[u][*it])
            {
                viz[*it]=1;
                ante[*it]=u;
                q[++q[0]]=*it;
            }
        }
    }

    return viz[sink];
}
void dinic(int sink)
{
    vector<int>::iterator it;
    int fmin,i;
    for(flow=0;BFS(sink);)
    {
        fmin=oo;
        for(it=G[sink].begin();it<G[sink].end();it++)
        if(viz[*it] && C[*it][sink]>0) ///
        {
            fmin=C[*it][sink]-F[*it][sink];

            for(i=*it;i>1;i=ante[i])
            {
                fmin=min(fmin,C[ante[i]][i]-F[ante[i]][i]);
            }

            F[*it][sink]+=fmin;
            F[sink][*it]-=fmin;
            for(i=*it;i>1;i=ante[i])
            {
                F[ante[i]][i]+=fmin;
                F[i][ante[i]]-=fmin;
            }
            flow+=fmin;
        }
       // cout<<fmin<<" ";

    }
   // cout<<"\n"<<sink<<" "<<flow<<"\n\n";
}

void solve()
{int i,j,vmin,k;
vector<int> sol;
    i=1;
    vmin=oo;
    for(j=N;j<=N;j++)
    {
        memset(F,0,sizeof(F));
        flow=0;
        dinic(j);

        if(vmin>flow)
         { sol.clear();
           vmin=flow;

           for(k=1;k<=M;k++)
           {   int f;
               f=max(F[a[k].x][a[k].y],F[a[k].y][a[k].x]);//>0?F[a[k].x][a[k].y]:-F[a[k].x][a[k].y];
               if( f==C[a[k].x][a[k].y])
                  sol.pb(k);
           }

         }

    }
    fout<<vmin;/*<<" "<<sol.size()<<"\n";
    for(i=0;i<sol.size();i++)
      fout<<sol[i]<<"\n";*/

}

void cit()
{int i,z;
    //ifstream fin("sabotaj.in");
    ifstream fin("maxflow.in");
    fin>>N>>M;
    for(i=1;i<=M;i++)
    {
        fin>>a[i].x>>a[i].y>>z;

        G[a[i].x].pb(a[i].y);
        G[a[i].y].pb(a[i].x);
        C[a[i].x][a[i].y]+=z;
        //C[a[i].y][a[i].x]+=z;
        F[a[i].x][a[i].y]=0;
        F[a[i].y][a[i].x]=0;
        //cout<<a[i].x<<" "<<a[i].y<<" "<<C[a[i].x][a[i].y]<<"\n";

    }

    fin.close();

}

int main()
{
    cit();

    solve();

    fout.close();
    return 0;

}