#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    int n,m;
    cin>>n>>m;
    vector<vector<int> >a(n,vector<int>(n,0));
    for(int i = 0;i<m;i++){
        int u,v,c;
        cin>>u>>v>>c;
        a[u][v] = c;
    }
    vector<int> dp(1<<n,0);
    for(int i = 0;i<1<<n;i++){
        for(int j = 0;j<n;j++)if(~i>>j&1){
            int now = 0;
            for(int k = 0;k<n;k++) if(i>>k&1) now += a[k][j];
            dp[i|1<<j] = max(dp[i|1<<j],dp[i]+now);
        }
    }
    cout<<dp[(1<<n)-1]<<endl;

}