#include <bits/stdc++.h>

using namespace std;

#define INFILE "hamilton.in"
#define OUTFILE "hamilton.out"

class Node {

public:
    int node;
    int cost;

    Node(){}
    Node(int _node, int _cost) : node(_node), cost(_cost) {}

};

const int N_MAX = 18;
const int SUBM_MAX = (1 << N_MAX);
const int INF = 0x3f3f3f3f;

int n, m;
vector<Node> adj[N_MAX + 1];
int d[SUBM_MAX + 1][N_MAX + 1];

void solve(){

    cin >> n >> m;
    while(m--){
        int node, to, cost; cin >> node >> to >> cost;
        adj[node].push_back(Node(to, cost));
    }

    memset(d, INF, sizeof d);

    d[1][0] = 0;
    for(int bit = 3; bit < (1 << n); ++bit){
        for(int node = 0; node < n; ++node){
            if(bit & (1 << node)){
                int s = bit ^ (1 << node);
                for(auto &to : adj[node]){
                    if(s & (1 << to.node)){
                        d[bit][node] = min(d[bit][node], d[s][to.node] + to.cost);
                    }
                }
            }
        }
    }

    int ans = INF;
    for(auto &to : adj[0]){
        ans = min(ans, d[(1 << n) - 1][to.node] + to.cost);
    }

    if(ans == INF){
        cout << "Nu exista solutie" << '\n';
    }
    else {
        cout << ans << '\n';
    }

}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    freopen(INFILE, "r", stdin);
    freopen(OUTFILE, "w", stdout);
    solve();
    return 0;
}