import sys
INF = float('inf')
#10**20,2**63,float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
#from collections import defaultdict
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    N,M = MI()
    Score = [[0]*N for _ in range(N)]
    for _ in range(M):
        item1,item2,s = MI()
        Score[item1][item2] = s
    DP = [-INF for _ in range(2 ** N)]
    DP[0] = 0
    from pprint import pprint
    for S in range(2 ** N):
        if S == 0:
            for n in range(N):
                DP[S | (1 << n)] = 0
            continue
        for t in range(N):
            if S >> t & 1:continue
            Tmp = 0
            for s in range(N):
                if S >> s & 1:
                    Tmp += Score[s][t]
            DP[S|(1 << t)] = max(DP[S] + Tmp,DP[S|(1 << t)])
    #print(DP)
    print(DP[S])
    return
solve()
#sys.setrecursionlimit(10 ** 6)#再帰関数ではコメントにしないこと！！