#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using P = pair<int, ll>;

ll dp[16][1 << 16];
bool memo[16][1 << 16];

/* 
void dfs(int src, int cur, int used, ll& ans) {
    //memo[src][cur][used] = true;
    for (P& p : g[cur]) {
        if (used & (1 << p.first)) continue;
        int n_used = (used | (1 << p.first));
        ll& tar = dp[src][p.first][n_used];
        ll cost = dp[src][cur][used] + p.second;
        if (tar < cost) {
            tar = cost;
            ans = max(ans, tar);
            dfs(src, p.first, n_used, ans);
        }
    }
}*/

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    vector< vector<ll> > d(n, vector<ll>(n, -1));
    for (int i = 0; i < n; i++) {
        d[i][i] = 0;
        memo[i][1 << i] = true;
    }

    for (int i = 0; i < m; i++) {
        int a, b;
        ll c;
        cin >> a >> b >> c;
        a--; b--;
        d[a][b] = max(c, d[a][b]);
        d[b][a] = max(c, d[b][a]);
    }

    ll ans = 0;
    for (int i = 1; i < (1 << n) - 1; i++) {
        for (int j = 0; j < n; j++) {
            if (i & (1 << j)) {
                if (!memo[j][i]) continue;
                for (int k = 0; k < n; k++) {
                    if (i & (1 << k)) continue;
                    if (d[j][k] == -1) continue;
                    dp[k][i | (1 << k)] = max(dp[k][i | (1 << k)], dp[j][i] + d[j][k]);
                    memo[k][i | (1 << k)] = true;
                    ans = max(ans, dp[k][i | (1 << k)]);
                }
            }
        }
    }

    /* 
    ll ans = 0;
    do {
        ll hoge = 0;
        for (int i = 1; i < n; i++) {
            if (d[v[i-1]][v[i]] == -1) {
                sort(v.begin() + i + 1, v.end());
                reverse(v.begin() + i + 1, v.end());
                break;
            } else {
                hoge += d[v[i-1]][v[i]];
            }
        }
        ans = max(ans, hoge);
    } while (next_permutation(v.begin(), v.end()));
    cout << ans << "\n";
    */

    /* 
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < i; j++) {
            if (d[i][j] == -1) continue;
            g[i].emplace_back(j, d[i][j]);
            g[j].emplace_back(i, d[j][i]);
        }
    }

    ll ans = 0;
    for (int i = 0; i < n; i++) {
        dfs(i, i, 1 << i, ans);
    }*/
    cout << ans << "\n";
    return 0;
}