n, m = map(int, input().split())
A = [[0] * n for _ in range(n)]
for _ in range(m):
    i, j, s = map(int, input().split())
    A[i - 1][j - 1] += s

dp = [0] * (1 << n)
for bit in range(1, 1 << n):
    bef = []
    aft = []
    for i in range(n):
        if bit >> i & 1:
            bef.append(i)
        else:
            aft.append(i)
    for j in aft:
        nbit = bit | (1 << j)
        tot = 0
        for i in bef:
            tot += A[i][j]
        dp[nbit] = max(dp[nbit], dp[bit] + tot)

print(dp[-1])