N,M = map(int,input().split())
INF = float('INF')
lsg = [[-INF]*N for _ in range(N)]
for i in range(M):
    a,b,c = map(int,input().split())
    a -= 1
    b -= 1
    lsg[a][b] = max(lsg[a][b],c)
    lsg[b][a] = max(lsg[b][a],c)
dp = [[-INF]*(2**N) for _ in range(N)]
for i in range(N):
    dp[i][1<<i] = 0
for i in range(2**N):
    for j in range(N):
        for k in range(N):
            if (i >> k) & 1:
                continue
            dp[k][i|(1<<k)] = max(dp[j][i]+lsg[j][k],dp[k][i|(1<<k)])
ans = 0
for i in range(N):
    ans = max(ans,max(dp[i]))
print(ans)