#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <string>
#include <cstring>
#define ll long long

using namespace std;

const int INF = 1e9;

int main() {
    ifstream in("hamilton.in");
    ofstream out("hamilton.out");

    int n, m;
    in >> n >> m;
    vector<vector<pair<int, int>>> g(n + 1);
    vector<int> cost1(n + 1, INF);
    for(int i = 1; i <= m; i ++) {
        int x, y, c;
        in >> x >> y >> c;
        x ++;
        y ++;
        g[x].push_back({y, c});
        if(y == 1)
            cost1[x] = min(cost1[x], c);
    }
    vector<vector<int>> dp((1 << n), vector<int> (n + 1, INF));
    dp[1][1] = 0;
    for(int mask = 1; mask < (1 << n); mask ++) {
        for(int i = 1; i <= n; i ++) {
            if((1 << (i - 1)) & mask) {
                for(auto it : g[i]) {
                    int bitt = (1 << (it.first - 1));
                    if(mask & bitt)
                        continue;
                    dp[mask ^ bitt][it.first] = min(dp[mask ^ bitt][it.first], dp[mask][i] + it.second);
                }
            }
        }
    }
    int ans = INF;
    for(int i = 1; i <= n; i ++)
        ans = min(ans, dp[(1 << n) - 1][i] + cost1[i]);

    if(ans == INF)
        out << "Nu exista solutie\n";
    else
        out << ans << "\n";

    return 0;
}