#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <functional>
#include <tuple>
#include <climits>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <iomanip>

using namespace std;

int main()
{
    int N, M;
    cin >> N >> M;
    vector<int> item1(M), item2(M), score(M);
    for(int i=0; i<M; i++)
        cin >> item1[i] >> item2[i] >> score[i];
    vector<int> dp(1<<N, 0);
    dp[0] = 0;
    for(int i=0; i<(1<<N)-1;i++) {
        for(int j=0; j<N; j++) {
            if((i&(1<<j)) != 0) continue;
            int total_score = 0;
            for(int k=0; k<M; k++)
                if(item1[k]==j && (i&(1<<item2[k])) == 0) total_score += score[k];
            dp[i | (1<<j)] = std::max(dp[i|(1<<j)], dp[i]+total_score);
        }
    }
    cout << dp[(1<<N)-1] << endl;
}