import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

n, m = MI()
to = [[] for _ in range(n)]
for _ in range(m):
    u, v, c = MI1()
    to[u].append((v, c+1))
    to[v].append((u, c+1))

def chmax(bit, i, val):
    global ans
    if val > dp[bit][i]:
        dp[bit][i] = val
        if val > ans: ans = val

ans = 0
dp = [[-1]*n for _ in range(1 << n)]
for u in range(n): dp[1 << u][u] = 0
for bit in range(1, 1 << n):
    for u in range(n):
        d = dp[bit][u]
        if d == -1: continue
        for v, c in to[u]:
            if bit >> v & 1: continue
            chmax(bit | 1 << v, v, d+c)

print(ans)