#include<iostream>
#include<cstring>
using namespace std;
const int NODE = 14;
const int BUF = 1 << NODE;


int nNode;
int adj[NODE][NODE];

void read() {
    memset(adj, 0, sizeof(adj));

    int nEdge;
    cin >> nNode >> nEdge;
    
    for (int i = 0; i < nEdge; ++i) {
        int s, t, c;
        cin >> s >> t >> c;
        adj[s][t] = c;
    }
}


int rec(int mask, int dp[BUF]) {
    
    if (mask == 1 << nNode) {
        return 0;
    }
    
    int &ret = dp[mask];
    if (ret >= 0) return ret;
    
    ret = 0;
    
    for (int i = 0; i < nNode; ++i) {
        if (mask & (1 << i)) continue;
        
        int toAdd = 0;
        for (int j = 0; j < nNode; ++j) {
            if ((mask & (1 << j))) {
                toAdd += adj[j][i];
            }
        }
        
        ret = max(ret, rec(mask | (1 << i), dp) + toAdd);
    }
    
    return ret;
}


void work() {
    int dp[BUF];
    memset(dp, -1, sizeof(dp));
    
    cout << rec(0, dp) << endl;
}


int main() {
    read();
    work();
    return 0;
}