#include<iostream>
#include<fstream>
#include<vector>
const int NMAX = 18;
const int INF = 2e8;
std::ifstream in("hamilton.in");
std::ofstream out("hamilton.out");
using namespace std;
vector<int>g[NMAX];
int a[18][18];
int u, v, n, m, cost;
int main() {
	in >> n >> m;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++) a[i][j] = INF;
	while (m--) {
		in >> u >> v >> cost;
		a[v][u] = cost;
		g[u].push_back(v);
	}
	vector<vector<int>>dp(1 << n, vector<int>(n, INF));
	dp[1][0] = 0;
	for (int mask = 3; mask < (1 << n); mask += 2)
		for (int i = 1; i < n; i++)
			if (mask & (1 << i))
				for (auto j : g[i])
					dp[mask][i] = min(dp[mask][i], dp[mask ^ (1 << i)][j] + a[j][i]);
	int ans = INF;
	for (int i = 1; i < n; i++)
		ans = min(ans, dp[(1 << n) - 1][i] + a[i][0]);
	if (ans == INF) out << "Nu exista solutie";
	else out << ans;
	return 0;
}