#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>

#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int i=n;i>=0;--i)
#define REPI(itr,v) for(auto itr=v.begin();itr!=v.end();++itr)
#define REPIR(itr,v) for(auto itr=v.rbegin();itr!=v.rend();++itr)
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define SORT(v,n) sort(v, v+n)
#define SORTV(v) sort(v.begin(), v.end())
#define ALL(v) v.begin(),v.end()
#define llong long long
#define ll long long
#define INF 999999999
#define SUR 1000000007
#define pb(a) push_back(a)
#define pf(a) push_front(a)
#define MP make_pair
#define SV(n,v) {int tmp;for(int i=0;i<n;++i){scanf("%d",&tmp);v.push_back(tmp);}}

int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};

using namespace std;

typedef pair<int,int> pii;

int main(){

  int n, m;
  scanf("%d %d", &n, &m);

  int g[14][14] = {};
  REP(i,m){
    int a, b, c;
    scanf("%d %d %d", &a, &b, &c);
    g[a][b] = c;
  }

  llong dp[1 << n] = {};
  REP(i, 1 << n){
    REP(j, n){
      if(!(i & (1 << j))){ //jがiに入ってない場合
        int sum = 0;
        REP(k, n){
          if(i & (1 << k)){
            sum += g[k][j];
          }
        }
        dp[i | (1 << j)] = max(dp[i | (1 << j)], dp[i] + sum);
      }
    }
  }

  printf("%lld\n", dp[(1 << n) - 1]);
  return 0;
}