#include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

const int N = 20, B = 1 << N;

int n, m, g[N][N], f[B][N]; // mask, last pos

int main() {
    // freopen("ticket.in", "r", stdin);
    // freopen("ticket.out", "w", stdout);

    scanf("%d%d", &n, &m);
    memset(g, -1, sizeof(g));
    for (int i = 1, a, b, c; i <= m; ++i) {
        scanf("%d%d%d", &a, &b, &c);
        --a, --b;
        g[a][b] = g[b][a] = max(g[a][b], c);
    }

    memset(f, -1, sizeof(f));
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        f[1 << i][i] = 0;
    }
    for (int mask = 1; mask < 1 << n; ++mask) {
        for (int v = 0; v < n; ++v) {
            if (f[mask][v] == -1) continue;
            ans = max(ans, f[mask][v]);
            for (int u = 0; u < n; ++u) {
                if (mask >> u & 1) continue;
                if (g[v][u] == -1) continue; // 不联通
                int nmask = mask | 1 << u;
                f[nmask][u] = max(f[nmask][u], f[mask][v] + g[v][u]);
            }
        }
    }

    printf("%d\n", ans);

    return 0;
}