#include <bits/stdc++.h>

#define REP(i, n) for (int i = 0; i < n; i++)
#define llINF ((long long)1e18)
#define iINF ((int)1e9)
#define ALL(obj) obj.begin(), obj.end()

using namespace std;

int N, M;
int item1[200], item2[200], score[200], dp[1 << 14];

int rec(int S) {
    if (dp[S] != -1) {
        return dp[S];
    }

    if (S == (1 << N) - 1) {
        return 0;
    }

    int res = 0;
    REP(s, N) {
        int plus = 0;
        if ((S >> s) & 1) continue;
        REP(i, M) {
            if (((S >> item1[i]) & 1) && item2[i] == s) {
                plus += score[i];
            }
        }
        res = max(res, rec(S | (1 << s)) + plus);
    }
    return dp[S] = res;
}

int main() {
    cin >> N >> M;
    REP(i, M) { cin >> item1[i] >> item2[i] >> score[i]; }
    memset(dp, -1, sizeof(dp));
    cout << rec(0) << endl;
}