n, m = map(int, input().split())
dist = [[-1 << 30] * n for _ in range(n)]
for i in range(n):
    dist[i][i] = 0
    
for _ in range(m):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    dist[a][b] = max(dist[a][b], c)
    dist[b][a] = max(dist[b][a], c)
    
dp = [[0] * n for _ in range(1 << n)]
for bit in range(1, 1 << n):
    for i in range(n):
        if not bit >> i & 1:
            continue
        for j in range(n):
            if i == j or not bit >> j & 1:
                continue
            dp[bit][j] = max(dp[bit][j], dp[bit ^ (1 << j)][i] + dist[i][j])
print(max(dp[-1]))