#include <fstream>
#include <vector>
#define INF 1000000000
using namespace std;
ifstream fin("hamilton.in");
ofstream fout("hamilton.out");
vector < pair<int,int> > v[20],vec0;
int n,m,i,j,x,y,c,d[20][(1<<20)],sol;
int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>c;
        v[x].push_back({y,c});
        if(y==0)
            vec0.push_back({x,c});
    }
    for(i=0;i<n;i++)
        for(j=0;j<(1<<n);j++)
            d[i][j]=INF;
    ///consider nodul 1 start ciclu
    ///toate starile o sa inceapa cu 1 => valori impare
    ///d[nod][stare]=costul minim lant care incepe in 0 si se termina in nod si are componenta nodurilor=stare
    d[0][1]=0;
    for(int stare=1;stare<(1<<n);stare+=2)
        for(i=0;i<n;i++)
            if(d[i][stare]!=INF)
                for(j=0;j<v[i].size();j++){
                    int vecin=v[i][j].first;
                    int cost=v[i][j].second;
                    if((stare & (1<<vecin))==0) ///bitul vecin nu e vizitat deja (in componenta lantului, nu pe ultima poz)
                        d[vecin][stare+(1<<vecin)] = min(d[vecin][stare+(1<<vecin)], d[i][stare]+cost);

                }
    for(sol=INF,i=0;i<vec0.size();i++) ///verific daca e muchie si de la ultimul la 0 (ca sa fie ciclu)
        sol=min(sol,d[vec0[i].first][(1<<n)-1]+vec0[i].second);
    if(sol==INF)
        fout<<"Nu exista solutie";
    else fout<<sol;
    return 0;
}