#!/usr/bin/env pypy
# -*- coding: utf-8 -*-

import heapq
import itertools


if __name__ == "__main__":
    n, m = map(int, input().split())
    table = {(item1, item2, score) for item1, item2, score in (
        map(int, input().split()) for i in range(m))}
    sums = []
    for items_p in itertools.permutations(range(n)):
        heapq.heappush(sums,
                       -sum(score for (item1, item2, score) in table
                            if items_p.index(item1) < items_p.index(item2)))
    print(-sums[0])