import sys
input = sys.stdin.readline

N, M = map(int, input().split())
G = [[0]*N for _ in range(N)]

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

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

for S in range(1<<N):
    for i in range(N):
        if (S>>i)&1:
            for j in range(N):
                if G[i][j]>0 and not (S>>j)&1:
                    dp[S|(1<<j)][j] = max(dp[S|(1<<j)][j], dp[S][i]+G[i][j])
    
ans = 0

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

print(ans)