#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>

using namespace std;
const int nmax = 65;
const int inf = 1<<30;

int i,n,m,x,y,c,sol,add;
int cap[nmax][nmax];
int cost[nmax][nmax];
int flow[nmax][nmax];
int gin[nmax],gout[nmax];
int dist[nmax];
int f[nmax];

vector<int> v[nmax];
bitset<nmax> inq;
deque<int> q;

bool bf()
{
    for(i=1;i<=n+1;i++) dist[i]=inf;

    dist[0]=0;
    f[0]=0;

    inq[0]=1;
    q.push_back(0);

    while(!q.empty())
    {
        x=q.front();
        inq[x]=0;
        q.pop_front();

        for(vector<int>::iterator it=v[x].begin();it!=v[x].end();it++)
            if(dist[x]+cost[x][*it]<dist[*it] && flow[x][*it]<cap[x][*it])
            {
                dist[*it]=dist[x]+cost[x][*it];
                f[*it]=x;

                if(!inq[*it])
                {
                    inq[*it]=1;
                    q.push_back(*it);
                }
            }
    }

    return dist[n+1]!=inf;
}

int main()
{
    freopen("traseu.in","r",stdin);
    freopen("traseu.out","w",stdout);

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

    for(;m;m--)
    {
        scanf("%d%d%d",&x,&y,&c);

        v[x].push_back(y);
        v[y].push_back(x);

        cap[x][y]=inf;

        cost[x][y]=c;
        cost[y][x]=-c;

        gin[y]++;
        gout[x]++;

        sol+=c;
    }

    for(i=1;i<=n;i++)
    {
        if(gin[i]>gout[i])
        {
            v[0].push_back(i);
            v[i].push_back(0);

            cap[0][i]=gin[i]-gout[i];
        }
        else if(gin[i]<gout[i])
        {
            v[i].push_back(n+1);
            v[n+1].push_back(i);

            cap[i][n+1]=gout[i]-gin[i];
        }
    }

    while(bf())
    {
        add=inf;

        for(x=n+1;x!=f[x];x=f[x])
            add=min(add,cap[f[x]][x]-flow[f[x]][x]);

        for(x=n+1;x!=f[x];x=f[x])
        {
            flow[f[x]][x]+=add;
            flow[x][f[x]]-=add;
        }

        sol+=dist[n+1]*add;
    }

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

    return 0;
}