N, M = map(int, input().split())

g = [[0] * N for _ in range(N)]
for i in range(M):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    g[a][b] = g[b][a] = max(g[a][b], c)

dp = [[-1] * N for _ in range(1 << N)]
for i in range(N):
    dp[1 << i][i] = 0

for i in range(1 << N):
    for a in range(N):
        if dp[i][a] == -1: continue

        for b in range(N):
            if i & (1 << b): continue
            if g[a][b] == 0: continue

            ni = i | (1 << b)
            dp[ni][b] = max(dp[ni][b], dp[i][a] + g[a][b])

ans = 0
for i in range(1 << N):
    for j in range(N):
        ans = max(ans, dp[i][j])

print(ans)