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

edge = [[-1 for i in range(N + 1)] for j in range(N)]

for i in range(M):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    edge[a][b] = edge[b][a] = max(edge[b][a], c)

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

mx = 0
for bit in range(1 << N):
    for i in range(N):
        if dp[bit][i] < 0:
            continue
        flag = False
        for j in range(N):
            if bit & (1 << j) == 0 and edge[i][j] >= 0:
                flag = True
                dp[bit | (1 << j)][j] = max(dp[bit | (1 << j)][j], dp[bit][i] + edge[i][j])
        if not flag:
            mx = max(mx, dp[bit][i])

print(mx)