N,M = map(int,input().split())
A = [[-1] * N for _ in range(N)]
NB = 1 << N
for _ in range(M):
    a,b,c = map(int,input().split())
    a -= 1
    b -= 1
    A[a][b] = c
    A[b][a] = c
D = [[-1] * N for _ in range(NB)]
for i in range(N):
    D[1<<i][i] = 0
for S in range(NB):
    for u in range(N):
        if not(S>>u & 1):
            continue
        for v in range(N):
            if S>>v & 1:
                continue
            if A[u][v] == -1:
                continue
            if D[S][u] != -1:
                D[S|1<<v][v] = max(D[S|1<<v][v],D[S][u]+A[u][v])

ans = 0
for d in D:
    #print (*d)
    #print()
    ans = max(ans,max(d))
print(ans)