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

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) for(auto (u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const int inf = 1e9;
const ll linf = 1LL<<60;
const ll mod = 1e9 + 7;
const double eps = 1e-9;

/*
  bitDP
*/

int dp[1<<14];

int main()
{
  int n, m;
  cin >> n >> m;

  vi x(m), y(m), z(m);
  rep(i, m) cin >> x[i] >> y[i] >> z[i];

  rep(mask, 1<<n){
    rep(i, n){
      if(!(mask & 1<<i)){
        int sum = 0;
        rep(j, m){
          if(y[j] == i and mask & 1<<x[j]){
            sum += z[j];
          }
        }
        dp[mask | 1<<i] = max(dp[mask | 1<<i], dp[mask] + sum);
      }
    }
  }

  cout << dp[(1<<n)-1] << endl;

  return 0;
}