#include<queue>

 #include<cstdio>

 #include<cctype>

 #include<vector>

 #include<cstring>

 inline int getint() {

     char ch;

     while(!isdigit(ch=getchar()));

     int x=ch^'';

     while(isdigit(ch=getchar())) x=(((x<<)+x)<<)+(ch^'');

     return x;

 }

 const int N=,M=,inf=0x7fffffff;

 struct Edge {

     int from,to,remain;

 };

 Edge e[M<<];

 std::vector<int> g[N];

 int sz=;

 inline void add_edge(const int u,const int v,const int w) {

     e[sz]=(Edge){u,v,w};

     g[u].push_back(sz);

     sz++;

 }

 int s,t;

 int a[N],p[N];

 inline int Augment() {

     memset(a,,sizeof a);

     a[s]=inf;

     std::queue<int> q;

     q.push(s);

     while(!q.empty()&&!a[t]) {

         int x=q.front();

         q.pop();

         for(unsigned i=;i<g[x].size();i++) {

             Edge &y=e[g[x][i]];

             if(!a[y.to]&&y.remain) {

                 p[y.to]=g[x][i];

                 a[y.to]=std::min(a[x],y.remain);

                 q.push(y.to);

             }

         }

     }

     return a[t];

 }

 inline int EdmondsKarp() {

     int maxflow=;

     while(int flow=Augment()) {

         for(int i=t;i!=s;i=e[p[i]].from) {

             e[p[i]].remain-=flow;

             e[p[i]^].remain+=flow;

         }

         maxflow+=flow;

     }

     return maxflow;

 }

 int main() {

     int n=getint(),m=getint();

     s=,t=n;

     while(m--) {

         int u=getint(),v=getint(),w=getint();

         add_edge(u,v,w);

         add_edge(v,u,);

     }

     printf("%d\n",EdmondsKarp());

     return ;

 }