local mmi, mma = math.min, math.max
local bls, brs = bit.lshift, bit.rshift
local n, m = io.read("*n", "*n")
local tot = bls(1, n)
local cost = {}
for i = 1, n do
  cost[i] = {}
end
for i = 1, m do
  local a, b, s = io.read("*n", "*n", "*n")
  a, b = a + 1, b + 1
  cost[a][b] = s
end

local function bdp_prepare()
  local alltask = {}
  local stagetask = {}
  for i = 1, n do
    stagetask[i] = {}
  end
  for i = 1, tot - 1 do
    -- set empty state
    alltask[i] = 0
  end
  for i = 1, tot - 1 do
    local ti = i
    local cnt = 0
    for j = 1, n do
      if ti % 2 == 1 then
        cnt = cnt + 1
        ti = ti - 1
      end
      ti = ti / 2
    end
    table.insert(stagetask[cnt], i)
  end
  -- set first state
  local tmp = 1
  for i = 1, n do
    alltask[tmp] = 0
    tmp = tmp * 2
  end
  return alltask, stagetask
end

local function bdp_doall(alltask, stagetask)
  for stage = 1, n - 1 do
    local stlen = #stagetask[stage]
    for i_stagetask = 1, stlen do
      local used = stagetask[stage][i_stagetask]
      local usedlist = {}
      do
        local tmp = used
        for j = 1, n do
          if tmp % 2 == 1 then
            table.insert(usedlist, j)
            tmp = tmp - 1
          end
          tmp = tmp / 2
        end
      end
      local mul = 1
      local tmp = used
      for j = 1, n do
        if tmp % 2 == 0 then
          local point = 0
          for k = 1, #usedlist do
            local v = cost[usedlist[k]][j]
            if v then point = point + v end
          end
          alltask[used + mul] = mma(alltask[used + mul], alltask[used] + point)
        else
          tmp = tmp - 1
        end
        tmp = tmp / 2
        mul = mul * 2
      end
    end
  end
end

local function bdp_getresult(alltask)
  return alltask[tot - 1]
end
local at, st = bdp_prepare()
bdp_doall(at, st)
local ret = bdp_getresult(at)
print(ret)