#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

const int inf=2000000000;
vector<int> v[70];
queue<int> q;
char vaz[70];
int dist[70],tata[70],grad[70],cap[70][70],cost[70][70],flow[70][70],n,m;

int bellman_ford()
{
    for(int i=0;i<=n;i++) dist[i]=inf;
    q.push(0);
    vaz[0]=1;
    dist[0]=0;
    while(!q.empty())
    {
        int nod=q.front();q.pop();
        vaz[nod]=0;
        for(vector<int>::iterator it=v[nod].begin();it!=v[nod].end();it++)
            if(cap[nod][*it]>flow[nod][*it] && dist[*it]>dist[nod]+cost[nod][*it])
            {
                dist[*it]=dist[nod]+cost[nod][*it];
                tata[*it]=nod;
                if(vaz[*it] || *it==n) continue;
                q.push(*it);
                vaz[*it]=1;
            }
    }
    return(dist[n]<inf);
}

int main()
{
    freopen("traseu.in", "r", stdin);
    freopen("traseu.out", "w", stdout);
    scanf("%d%d",&n,&m);
    int x,y,s,sol=0;
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&s);
        sol+=s;
        v[x].push_back(y);
        v[y].push_back(x);
        cost[x][y]=s;
        cost[y][x]=-s;
        cap[x][y]=inf;
        grad[x]--;
        grad[y]++;
    }
    for(int i=1;i<=n;i++)
        if(grad[i]>0)
        {
            v[0].push_back(i);
            v[i].push_back(0);
            cap[0][i]=grad[i];
        }
        else if(grad[i]<0)
        {
            v[i].push_back(n+1);
            v[n+1].push_back(i);
            cap[i][n+1]=-grad[i];
        }
    n++;
    while(bellman_ford())
    {
        for(vector<int>::iterator it=v[n].begin();it!=v[n].end();it++)
            if(cap[*it][n]>flow[*it][n] && dist[*it]<inf)
            {
                tata[n]=*it;
                s=inf;
                for(int i=n;i;i=tata[i]) s=min(s,cap[tata[i]][i]-flow[tata[i]][i]);
                for(int i=n;i;i=tata[i])
                {
                    flow[tata[i]][i]+=s;
                    flow[i][tata[i]]-=s;
                    sol+=s*cost[tata[i]][i];
                }
            }
    }
    printf("%d",sol);
    return 0;
}