#include<map>

#include<set>

#include<cmath>

#include<queue>

#include<stack>

#include<vector>

#include<cstdio>

#include<cassert>

#include<iomanip>

#include<cstdlib>

#include<cstring>

#include<iostream>

#include<algorithm>

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pii pair<int,int>

#define C 0.5772156649

#define pi acos(-1.0)

#define ll long long

#define mod 20090717

#define ls l,m,rt<<1

#define rs m+1,r,rt<<1|1

using namespace std;

const double g=10.0,eps=1e-;

const int N=+,maxn=+,inf=0x3f3f3f3f;

struct edge{

    int to,Next,c;

    int cost;

}e[maxn<<];

int cnt,head[N];

int s,t;

int dis[N],pre[N],path[N];

void add(int u,int v,int c,int cost)

{

    e[cnt].to=v;

    e[cnt].c=c;

    e[cnt].cost=cost;

    e[cnt].Next=head[u];

    head[u]=cnt++;

    e[cnt].to=u;

    e[cnt].c=;

    e[cnt].cost=-cost;

    e[cnt].Next=head[v];

    head[v]=cnt++;

}

bool spfa()

{

    memset(pre,-,sizeof pre);

    memset(dis,inf,sizeof dis);

    dis[s]=;

    queue<int>q;

    q.push(s);

    while(!q.empty())

    {

        int x=q.front();

        q.pop();

        for(int i=head[x];~i;i=e[i].Next)

        {

            int te=e[i].to;

            if(e[i].c>&&dis[x]+e[i].cost<dis[te])

            {

                dis[te]=dis[x]+e[i].cost;

                pre[te]=x;

                path[te]=i;

                q.push(te);

            }

        }

    }

    return pre[t]!=-;

}

int mincostmaxflow()

{

    int cost=,flow=;

    while(spfa())

    {

        int f=inf;

        for(int i=t;i!=s;i=pre[i])

            if(e[path[i]].c<f)

               f=e[path[i]].c;

        flow+=f;

        cost+=dis[t]*f;

        for(int i=t;i!=s;i=pre[i])

        {

            e[path[i]].c-=f;

            e[path[i]^].c+=f;

        }

    }

    return cost;

}

void init()

{

    memset(head,-,sizeof head);

    cnt=;

}

int main()

{

   /* ios::sync_with_stdio(false);

    cin.tie(0);*/

    int n,m;

    while(~scanf("%d%d",&n,&m))

    {

        init();

        s=,t=n+;

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

        {

            int a,b,c;

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

            add(a,b,,c);

            add(b,a,,c);

        }

        add(,,,);

        add(n,n+,,);

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

    }

    return ;

}

/********************

********************/