#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include<functional>
#include<numeric>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<set>
#include<bitset>
#include<random>

#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define rep(i,n) FOR(i,0LL,n)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define rrep(i,n) RFOR(i,0LL,n)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define COUNT(a,y,x) upper_bound(all(a), y) - lower_bound(all(a), x)
#define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end())
#define pb push_back
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef map<ll, ll> MAP;
const ll inf = 1LL << 61;
const ll mod = 1000000007LL;
//const ll mod = 998244353LL;

ll n = 0, m = 0, ans = 0, tmp = 0, ma = -inf, mi = inf;
string s;
bool ok;
ll dx[9] = { 0,1,0,-1,0,1,1,-1,-1 }, dy[9] = { 0,0,1,0,-1,1,-1,1,-1 };
#define endl '\n'
#pragma endregion
#define MAX 222222


ll dp[1 << 18][18];
ll edge[22][22];


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


  cin >> n >> m;
  rep(i, n) rep(j, n) edge[i][j] = -inf;
  rep(i, m) {
    ll a, b, c;
    cin >> a >> b >> c;
    a--; b--;
    edge[a][b] = max(edge[a][b], c);
    edge[b][a] = max(edge[b][a], c);
  }

  rep(i, (1 << n)) rep(j, n) dp[i][j] = -inf;
  rep(i, n) dp[(1 << i)][i] = 0;
  rep(i, (1 << n)) {
    rep(j, n) {
      if (dp[i][j] == -inf) continue;
      rep(k, n) {
        if (edge[j][k] == -inf) continue;
        if ((i >> k) & 1) continue;
        dp[i | (1 << k)][k] = max(dp[i | (1 << k)][k], dp[i][j] + edge[j][k]);
      }
    }
  }

  rep(i, (1 << n)) rep(j, n) ans = max(ans, dp[i][j]);
  cout << ans << endl;


  return 0;
}