import Foundation

struct Bits {
  init(_ bits: UInt64) {
    self.bits = bits
  }
  var bits: UInt64
  
  func test(_ place: Int) -> Bool {
    let mask : UInt64 = 0x0000000000000001 << place
    return mask == (mask & self.bits)
  }

  mutating func reset(_ place:Int) {
    let mask : UInt64 = 0x0000000000000001 << place
    self.bits ^= mask 
  }
}

let nm = readLine()!.split(separator: " ").map { Int($0)! }
let n: Int = nm.first!
let m: Int = nm.last!

var rules =  Dictionary<Int, Int>()
 (0 ..< m).forEach { _ in 
  let values = readLine()!.split(separator: " ").map { Int($0)! }
  rules[(values[0] * 10 + values[1])] = values[2]
}

func solve(bits: Bits)-> Int {
  var ret = 0
  for i in 0 ..< n {
    guard bits.test(i) else {
      continue
    }
    var next = bits
    next.reset(i)
    var sum = solve(bits: next)
    for j in 0 ..< n {
      guard next.test(j) else {
        continue
      }
      guard let score = rules[i * 10 + j] else {
        continue
      }
      sum += score
    }
    ret = Swift.max(sum, ret)
  }
  return ret
}

let result = solve(bits: Bits(0x1FF >> (Int(9) - n)))
print(result)