#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream in("hamilton.in");
ofstream out("hamilton.out");

int n,m;
vector<int> L[20];
int D[20][20];
int DP[1<<18][20];

void read(){
    int x,y,t;
    in>>n>>m;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            D[i][j]=1000000000;
        }
    }
    for(int i=1;i<=m;i++){
        in>>x>>y>>t;
        L[y].push_back(x);
        D[x][y]=t;
    }
}
void solve(){
    for(int conf=0;conf<(1<<n);conf++){
        for(int i=0;i<n;i++){
            DP[conf][i]=1000000000;
        }
    }
    DP[1][0]=0;
    for(int conf=0;conf<(1<<n);conf++){
        for(int nod=0;nod<n;nod++){
            if(conf&(1<<nod)){
                for(auto x : L[nod]){
                    if(conf&(1<<x)){
                        DP[conf][nod]=min(DP[conf][nod],DP[conf^(1<<nod)][x]+D[x][nod]);
                    }
                }
            }
        }
    }
    int mini=1000000000;
    for(auto x : L[0]){
        mini=min(mini,DP[(1<<n)-1][x]+D[x][0]);
    }
    if(mini==1000000000)
        out<<"Nu exista solutie";
    else out<<mini;
}
int main(){
    read();
    solve();
    return 0;
}