from collections import defaultdict

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

graph = defaultdict(dict)
for _ in range(M):
    u, v, score = map(int, input().split())
    graph[v][u] = score
# print(graph)

dp = [0] * (1 << N)
for S in range(1 << N):
    for u in range(N):
        # すでにuがSに含まれていたらskip
        if S & (1 << u):
            continue
        # print(bin(S)[2:], u)
        score = 0
        for v in range(N):
            if not (S & (1 << v)):
                continue
            if v in graph[u]:
                # print(u, v)
                score += graph[u][v]
        # print(' score:', score)
        dp[S ^ (1 << u)] = max(dp[S ^ (1 << u)], dp[S] + score)

print(dp[-1])