#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

struct Edge {
  int to;
  int cost;

  Edge(int to = -1, int cost = -1) {
    this->to = to;
    this->cost = cost;
  }
};

int main() {
  int N, M;
  cin >> N >> M;
  vector<Edge> E[N + 1];

  for (int i = 0; i < M; ++i) {
    int a, b, c;
    cin >> a >> b >> c;

    --a;
    --b;
    E[a].push_back(Edge(b, c));
    E[b].push_back(Edge(a, c));
  }

  int L = pow(2, N);
  int dp[L][N];
  memset(dp, 0, sizeof(dp));
  int ans = 0;

  for (int c = 1; c < N; ++c) {
    for (int mask = 0; mask < L; ++mask) {
      if (__builtin_popcount(mask) != c) continue;

      for (int i = 0; i < N; ++i) {
        if ((mask >> i & 1) == 0) continue;

        for (Edge &e : E[i]) {
          if (mask >> e.to & 1) continue;
          int nmask = mask | (1 << e.to);
          int ncost = dp[mask][i] + e.cost;;

          dp[nmask][e.to] = max(dp[nmask][e.to], ncost);
          ans = max(ans, ncost);
        }
      }
    }
  }

  cout << ans << endl;

  return 0;
}