from itertools import count


n,m = map(int,input().split())
dist = [[-1]*n for i in range(n)]
for _ in range(m):
    a,b,c = map(int,input().split())
    a -= 1
    b -= 1
    dist[a][b] = dist[b][a] = max(dist[a][b],c)

dp = [[-1]*n for i in range(1<<n)]
for i in range(n):
    dp[1<<i][i] = 0
ans = 0
for i in range(1<<n):
    for j in range(n):
        if dp[i][j] < 0:
            continue
        ans = max(ans,dp[i][j])
        for nj in range(n):
            if i >> nj & 1 or dist[j][nj] < 0:
                continue
            dp[i|1<<nj][nj] = max(dp[i|1<<nj][nj],dp[i][j]+dist[j][nj])
print(ans)