import sys
sys.setrecursionlimit(10**8)
n,m=map(int,input().split())
connect=[[] for _ in range(n)]
weight=[]
ans=0
for i in range(m):
    a,b,c=map(int,input().split())
    a-=1
    b-=1
    connect[a].append((b,i))
    connect[b].append((a,i))
    weight.append(c)
    ans+=c
def DFS(now,past,edge):
    global visited
    global ans
    for to,ed in connect[now]:
        if visited[to] and to!=past and len(edge)>=2:
            idx=0
            check=ed
            for i in range(len(edge)):
                if check==ed:
                    idx=i
                    break
            ret=10**18
            for i in range(idx,len(edge)):
                ret=min(ret,weight[edge[i]])
            ans-=ret
            return 
        else:
            if not visited[to]:
                visited[to]=True
                edge.append(ed)
                DFS(to,now,edge)
                edge.pop()
            

visited=[False]*n
visited[0]=True
DFS(0,-1,[])
print(ans*2)