#include <bits/stdc++.h>
 
const double pi = 3.141592653589793238462643383279;
 
 
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
 
 
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
 
 
//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
 
 
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-11;
 
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)

//ここから編集

ll modPow(ll x, ll n, ll mod = MOD){
    ll res = 1;
    while(n){
        if(n&1) res = (res * x)%mod;
 
        res %= mod;
        x = x * x %mod;
        n >>= 1;
    }
    return res;
}
int dp[1<<18][18];
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);

  int N, M; cin >> N >> M;

  vector<vector<pair<int, int>>> G(20);
  REP(i,M){
    int a, b, c;
    cin >> a>>b>>c;
    a--;
    b--;
    G[a].push_back({b, c});
    G[b].push_back({a, c});
  }

  REP(i,(1<<N))REP(j,N)dp[i][j] = -1;

  REP(i,N){
    dp[(1<<i)][i] = 0;
  }

  for(int bit = 0; bit < (1<<N); bit++){
    
    for(int i=0; i<N; i++){
      if(dp[bit][i] == -1) continue;
      if(bit & (1<<i)){


        for(int j=0; j<G[i].size(); j++){
          int u = G[i][j].first;
          int cost = G[i][j].second;
          if(bit & (1 << u)) continue;

          dp[bit | (1<<u)][u] = max(dp[bit | (1 << u)][u], dp[bit][i] + cost);
        }
      }
    }
  }

  int ans = 0;
  for(int i=0; i<(1<<N); i++){
    for(int j=0; j<N; j++){
      ans = max(ans, dp[i][j]);
    }
  }
  cout << ans << endl;
  return 0;
}