import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto M = RD;
	auto edges = new long[long][](N);
	foreach (i; 0..M)
	{
		auto u = RD-1;
		auto v = RD-1;
		auto c = RD;
		auto x = edges[u].get(v, 0);
		edges[u][v] = max(x, c);
		auto y = edges[v].get(u, 0);
		edges[v][u] = max(y, c);
	}

	/*foreach (i; 0..N)
	{
		auto best = new long[](N);
		foreach (edge; edges[i])
		{
			auto to = edge[0];
			auto c  = edge[1];
			best[to] = max(best[to], c);
		}
		long[2][] newEdges;
		foreach (j, e; best)
		{
			if (e != 0)
				newEdges ~= [j, e];
		}
		edges[i] = newEdges;
	}*/

	long search(long start)
	{
		long[][] open = [[0, start, 1LU << start]];
		auto cost = new long[](N);
		while (!open.empty)
		{
			auto n = open.back; open.popBack;
			auto c = n[0];
			auto from = n[1];
			foreach (to; edges[from].keys)
			{
				auto d  = edges[from][to];
				auto bit = 1LU << to;
				if (bit & n[2]) continue;
				cost[to] = max(cost[to], c + d);
				open ~= [c+d, to, n[2] | bit];
			}
		}
		auto pos = cost.MIN_POS!"a > b";
		return cost[pos];
	}

	long ans;
	foreach (i; 0..N)
	{
		auto r = search(i);
		ans = max(ans, r);
	}

	writeln(ans);
	stdout.flush();
	debug readln();
}