#region Header
#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)
#endregion

# _INPUT = """# paste here...
# """
# sys.stdin = io.StringIO(_INPUT)


def main():
    N, M = map(int, input().split())
    score = [[0] * N for _ in range(N)]
    for _ in range(M):
        i, j, n = map(int, input().split())
        score[i-1][j-1] = n

    dp = [0] * (1<<N)
    for s in range(1<<N):
        for i in range(N):
            if s & (1<<i):
                continue
            score1 = sum(score[j][i] for j in range(N) if s & (1<<j))
            dp[s | (1<<i)] = max(dp[s | (1<<i)], dp[s] + score1)
    ans = dp[(1<<N)-1]
    print(ans)


if __name__ == '__main__':
    main()