import sys

def debug(x, table):
    for name, val in table.items():
        if x is val:
            print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
            return None

def bitDP(N, Mat):
    univ = 2**N - 1
    dp = [[0]*N for i in range(univ + 1)]

    for S in range(univ + 1):
        for v in range(N):
            S2 = S & (univ ^ (1 << v))
            for u in range(N):
                if S2 & (1 << u):
                    dp[S][v] = max(dp[S][v], dp[S2][u])

            for u in range(N):
                if S2 & (1 << u):
                    dp[S][v] += Mat[u][v]

    # debug(dp, locals())

    ans = max(dp[univ][u] for u in range(N))

    return ans

def solve():
    N, M = map(int, input().split())
    Mat = [[0]*N for i in range(N)]

    for i in range(M):
        i1, i2, score = map(int, input().split())
        Mat[i1][i2] = score

    ans = bitDP(N, Mat)

    print(ans)

if __name__ == '__main__':
    solve()