use std::cmp;
use std::io::{self, Read};

#[derive(Debug)]
struct Input {
    n: usize,
    scores: Vec<Vec<i32>>,
}

fn next_token(cin_lock: &mut io::StdinLock) -> String {
    cin_lock
        .by_ref()
        .bytes()
        .map(|c| c.unwrap() as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect::<String>()
}

fn read_input(cin_lock: &mut io::StdinLock) -> Input {
    let n = next_token(cin_lock).parse().unwrap();
    let m = next_token(cin_lock).parse().unwrap();

    let mut scores = vec![vec![0; n]; n];
    for _ in 0..m {
        let lhs: usize = next_token(cin_lock).parse().unwrap();
        let rhs: usize = next_token(cin_lock).parse().unwrap();
        let score = next_token(cin_lock).parse().unwrap();
        scores[lhs][rhs] = score;
    }

    Input { n, scores }
}

fn solve(input: Input, _cin_lock: &mut io::StdinLock) {
    let full_mask = (2 << (input.n - 1)) - 1;
    let mut dp = vec![vec![0; input.n]; full_mask + 1];

    for state in 0..=full_mask {
        for item_no in 0..input.n {
            let mask = !(1 << item_no);
            let excluded_state = state & mask;

            // 該当の商品を除外した場合の最高スコアを伝播させる
            for i in 0..input.n {
                if excluded_state & (0x01 << i) != 0 {
                    dp[state][item_no] = cmp::max(dp[state][item_no], dp[excluded_state][i]);
                }
            }

            // スコアを加算する
            for i in 0..input.n {
                if excluded_state & (0x01 << i) != 0 {
                    dp[state][item_no] += input.scores[i][item_no];
                }
            }
        }
    }

    let answer = dp[full_mask].iter().map(|x| *x).max().unwrap();
    println!("{}", answer);
}

fn main() {
    let cin = io::stdin();
    let mut cin_lock = cin.lock();

    let input = read_input(&mut cin_lock);
    solve(input, &mut cin_lock);
}