#include<stdio.h>

#include<queue>

#define MAXN 55000

#define MAXM 20002*5

#define INF  0x3f3f3f3f

using namespace std;

//起点编号必须最小，终点编号必须最大

bool vis[MAXN];                    //spfa中记录是否在队列里边

struct edge{

    edge *next,*op;                //op是指向反向边

    int t,c,v;                     //t下一个点编号，c容量，v权值

}ES[MAXM],*V[MAXN];                //ES边静态邻接表，V点的编号

int N,M,S,T,EC=-;                 //S源点最小，T汇点最大，EC当前边数

int demond[MAXN],sp[MAXN],prev[MAXN]; //spSPFA中记录距离，prev记录上一个点路径

edge *path[MAXN];                  //与prev同步记录，记录到上一条边

void addedge(int a,int b,int v,int c=INF){

    edge e1={V[a],,b,c,v},e2={V[b],,a,,-v};

    ES[++EC]=e1;V[a]=&ES[EC];

    ES[++EC]=e2;V[b]=&ES[EC];

    V[a]->op=V[b];V[b]->op=V[a];

}

void init(){

    int n,m;

    scanf("%d%d",&n,&m);

    S=;T=n+m*+;

    EC=-;

    addedge(S,,,);

    addedge(n,T,,);

    int a,b,c;

    for(int i=;i<=m;i++){

        scanf("%d%d%d",&a,&b,&c);

        addedge(a,n+i,,);

        addedge(b,n+i,,);

        addedge(n+m+i,a,,);

        addedge(n+m+i,b,,);

        addedge(n+i,n+m+i,c,);

    }

}

bool SPFA(){

    int u,v;

    for(u=S;u<=T;u++){

        sp[u]=INF;

    }

    queue<int>q;

    prev[S]=-;

    q.push(S);

    sp[S]=;

    vis[S]=;

    while(!q.empty()){

        u=q.front();

        vis[u]=;

        q.pop();

        for(edge *k=V[u];k;k=k->next){

            v=k->t;

            if(k->c>&&sp[u]+k->v<sp[v]){

                sp[v]=sp[u]+k->v;

                prev[v]=u;

                path[v]=k;

                if(vis[v]==){

                    vis[v]=;

                    q.push(v);

                }

            }

        }

    }

    return sp[T]!=INF;

}

int argument(){

    int i,cost=INF,flow=;

    edge *e;

    for(i=T;prev[i]!=-;i=prev[i]){

        e=path[i];

        if(e->c<cost)cost=e->c;

    }

    for(int i=T;prev[i]!=-;i=prev[i]){

        e=path[i];

        e->c-=cost;e->op->c+=cost;

        flow+=e->v*cost;

    }

    return flow;

}

int maxcostflow(){

    int Flow=;

    while(SPFA()){

        Flow+=argument();

    }

    return Flow;

}

int main(){

    init();

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

    return ;

}