#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))
#define sz(v) ((LLI)(v).size())

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> istream& operator>>(istream &is, pair<T,U> &p){is >> p.first >> p.second; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

const int inf = 1<<30;

int dp[1<<16][16];
bool used[1<<16][16];
int n,m;
int graph[16][16];

int rec(int i, int j){
  if(used[i][j]) return dp[i][j];
  used[i][j] = true;

  REP(k,n){
    if(j == k) continue;
    if(graph[k][j] > 0 and (i&bit(k))){
      chmax(dp[i][j], rec(i^bit(j),k) + graph[k][j]);
    }
  }

  return dp[i][j];
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  while(cin >> n >> m){
    fill_array(graph, -inf);

    REP(i,m){
      int a,b,c; cin >> a >> b >> c;
      --a;
      --b;
      
      chmax(graph[a][b], c);
      chmax(graph[b][a], c);
    }

    fill_array(dp, 0);
    fill_array(used, 0);

    REP(j,n) rec((1<<n)-1,j);

    

    int ans = 0;

    REP(i,1<<n){
      REP(j,n){
	chmax(ans, dp[i][j]);
      }
    }
    

    cout << ans << endl;
  }

  return 0;
}