def ints() gets.split.map(&:to_i) end
  
n, m = ints
$n = n

inf = 10**9
g = [-inf]*(n**2)
m.times do
  a, b, c = ints
  a -= 1
  b -= 1
  g[a*n+b] = [g[a*n+b], c].max
  g[b*n+a] = [g[b*n+a], c].max
end


dp = [-inf] * ((1<<n) * n)
def index(i, j) i * $n + j end
for i in 0...n
  dp[index(1 << i, i)] = 0
end

ans = -inf
for i in 0...1<<n
  for j in 0...n
    next if dp[index(i, j)] == -inf
    ans = [ans, dp[index(i, j)]].max
    for k in 0...n
      if (i >> k & 1) == 0
        t = index(i | 1 << k, k)
        dp[t] = [dp[t], dp[index(i, j)] + g[j*n+k]].max
      end
    end
  end
end

puts ans