/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.06.14 19:33:20
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int main() {
    int n,m;cin >> n >> m;
    constexpr long long LLINF = 1e18 + 1;
    vector<vector<ll>> g(n,vector<ll>(n,-LLINF));
    for (int i = 0; i < m; i++) {
        int u,v,c;
        cin >> u >> v >> c;
        u--;v--;
        g[u][v] = max(g[u][v],(ll)c);
        g[v][u] = max(g[v][u],(ll)c);
    }
    vector<vector<ll>> dp(1<<n,vector<ll>(n,-LLINF));
    for (int i = 0; i < n; i++) {
        dp[1<<i][i] = 0;
    }
    ll ans = 0;
    for (int i = 1; i < 1<<n; i++) {
        for (int j = 0; j < n; j++) {
            if (i & (1 << j)) {
                for (int k = 0; k < n; k++) {
                    if ((i ^ (1 << j)) & (1 << k)) {
                        dp[i][j] = max(dp[i][j],dp[i ^ (1 << j)][k] + g[j][k]);
                        ans = max(ans,dp[i][j]);
                    }
                }
            }
        }
    }
    cout << ans << endl;
    return 0;
}