from collections import *
from itertools import *
from functools import *
import sys,math
input = sys.stdin.readline

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

dist = [[-1]*N for _ in range(N)]

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[a][b],c)
for i in range(N):
    dist[i][i] = 0



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

def popcnt(x):
    
    return bin(x).count('1')

for i in range(1,1<<N):
    
    visited = []
    target = []
    for j in range(N):
        if (i>>j)&1:
            visited.append(j)
        else:
            target.append(j)
            
    for j in visited:
        
        for k in target:
            if dist[j][k]==-1:
                continue
            dp[k][i|(1<<k)] = max(dp[k][i|(1<<k)],dp[j][i]+dist[j][k])
            
print(max(dp[i][-1] for i in range(N)))