# No.357 品物の並び替え


def main():

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

    cost = [[0]*14 for _ in range(14)]
    dp = [0 for _ in range(2**N)]
    for i in range(M):
        a,b,s = map(int, input().split())
        cost[a][b] = s
    
    for bit in range(0,2**N):
        for i in range(N):
            if not (bit & (1<<i)):
                x = 0
                for j in range(N):
                    if not (bit & (1<<j)):
                        x += cost[i][j]

                dp[bit + (1<<i)] = max(dp[bit + (1<<i)], dp[bit] + x)
    
    print(dp[-1])



if __name__ == '__main__':
    main()