#include <iostream>
using namespace std;

const int kMAX_N = 16;

int score[kMAX_N][kMAX_N];

int total_score[1 << kMAX_N][kMAX_N];
int dp[1 << kMAX_N];

int main() {
    int N, M;
    cin >> N >> M;

    for (int i = 0; i < M; i++) {
        int item1, item2;
        cin >> item1 >> item2;
        cin >> score[item1][item2];
    }

    for (int mask = 0; mask < (1 << N); mask++) {
        for (int item = 0; item < N; item++) {
            int getscore = 0;
            for (int have_item = 0; have_item < N; have_item++) {
                if (!((mask >> have_item) & 1)) continue;
                getscore += score[have_item][item];
            }
            total_score[mask][item] = getscore;
        }
    }

    for (int mask = 0; mask < (1 << N); mask++) {
        for (int item = 0; item < N; item++) {
            if (!((mask >> item) & 1)) continue;
            int prev_mask = mask & ~(1 << item);
            dp[mask] = max(dp[mask], dp[prev_mask] + total_score[prev_mask][item]);
        }
    }
    cout << dp[(1 << N) - 1] << endl;
    return 0;
}