from collections import deque
N, M = map(int, input().split())

graph = [[] for i in range(N)]
cost = [[float('inf')]*N for _ in range(N)] # 重み

for _ in range(M):
  a, b, c = map(int, input().split())
  graph[a-1].append(b-1)
  graph[b-1].append(a-1)
  cost[a-1][b-1] = c
  cost[b-1][a-1] = c

l = []
count = 0
L = []
import copy
def dfs(start):
    l.append(start)
    if len(l) == N:
        global count
        count += 1
        l.append(l[0])

    for n in graph[start]:
        if n+1 in l:
            continue
        dfs(n)
    temp = copy.deepcopy(l)
    if len(temp) == N+1:
        L.append(temp)
    l.pop()

for i in range(N):
    dfs(i)
mn = float('inf')
for l in L:
    ans = 0
    for i in range(len(l)-1):
        ans += cost[l[i]][l[i+1]]

    mn = min(mn, ans)
print(mn)