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

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


dp = [[0]*N for _ in range(2**N)]

for s in range(1, 2**N):
    for i in range(N):
        if not 2**i & s:
            continue
        res = dp[s][i]
        for j in range(N):
            if 2**j & s or not Edge[i][j]:
                continue
            dp[s|2**j][j] = max(dp[s|2**j][j], Edge[i][j] + res)

ans = 0
for d in dp:
    ans = max(ans, max(d))
print(ans)