n, m = map(int, input().split())
score = [[0] * n for i in range(n)]

for i in range(m):
    x, y, s = map(int, input().split())
    score[x][y] = s

dp = [0] * (1 << n)
for i in range(1 << n):
    for j in range(n):
        if (i >> j) & 1:
            continue

        nxt_score = dp[i]
        for k in range(n):
            if (i >> k) & 1:
                nxt_score += score[j][k]

        dp[i | (1 << j)] = max(dp[i | (1 << j)], nxt_score)

print(dp[(1 << n) - 1])