import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, M;
int[] A, B, C;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      A = new int[M];
      B = new int[M];
      C = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
        C[i] = readInt();
      }
      
      auto d = new int[][](N, N);
      foreach (u; 0 .. N) foreach (v; 0 .. N) {
        d[u][v] = -1;
      }
      foreach (i; 0 .. M) {
        chmax(d[A[i]][B[i]], C[i]);
        chmax(d[B[i]][A[i]], C[i]);
      }
      auto dp = new int[][](1 << N, N);
      foreach (p; 0 .. 1 << N) {
        dp[p][] = -1;
      }
      foreach (u; 0 .. N) {
        dp[1 << u][u] = 0;
      }
      foreach (p; 0 .. 1 << N) {
        foreach (u; 0 .. N) {
          if ((p >> u) & 1) {
            foreach (v; 0 .. N) {
              if (!((p >> v) & 1)) {
                if (d[u][v] >= 0) {
                  chmax(dp[p | 1 << v][v], dp[p][u] + d[u][v]);
                }
              }
            }
          }
        }
      }
      int ans;
      foreach (p; 0 .. 1 << N) {
        foreach (u; 0 .. N) {
          chmax(ans, dp[p][u]);
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}