#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

int dp[1 << 16][16];

int main() {
    int n, m;
    cin >> n >> m;

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

        d[a][b] = max(d[a][b], c);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < i; j++) {
            d[i][j] = d[j][i];
        }
    }

    for (int i = 0; i < n; i++) {
        dp[1 << i][i] = 1;
    }

    int r = 0;
    for (int k = 1; k < 1 << n; k++) {
        for (int i = 0; i < n; i++) {
            if (dp[k][i]) continue;
            int t = 0;
            int k1 = k & ~(1 << i);
            if (k == k1) continue;
            for (int j = 0; j < n; j++) {
                if (d[i][j] == 0 || dp[k1][j] == 0) continue;
                t = max(t, d[i][j] + dp[k1][j]);
            }
            r = max(r, dp[k][i] = t);
        }
    }

    cout << r - 1 << endl;

    return 0;
}