/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.05.31 00:58:15
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int main() {
    int n, m;
    cin >> n >> m;
    vector< int > dp(1 << n, 0);
    vector< vector< pair< int, int > > > v(n);
    for (int i = 0; i < m; i++) {
        int a, b, s;
        cin >> a >> b >> s;
        v[b].push_back({a, s});
    }
    for (int i = 1; i < 1 << n; i++) {
        for (int j = 0; j < n; j++) {
            if (i & (1 << j)) {
                int score = 0;
                for (int k = 0; k < v[j].size(); k++) {
                    if (i & (1 << v[j][k].first)) {
                        score += v[j][k].second;
                    }
                }
                dp[i] = max(dp[i], dp[i ^ (1 << j)] + score);
            }
        }
    }
    cout << dp[(1 << n) - 1] << endl;
    return 0;
}