#include <fstream>
#include <vector>

using namespace std;
ifstream in("hamilton.in");
ofstream out("hamilton.out");
const int N=20;
const int INF=1<<30;
vector< pair<int,int> >a[N];
int n,m,d[1<<N][N];//d[i][j]=lantul de cost minim de la 0 la j care contine nodurile ce corespund cu 1 in config binara a lui i

int main()
{
    int x,y,c;
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y>>c;
        a[y].push_back(make_pair(x,c));
    }
    for(int i=1;i<(1<<n);i++)
        for(int j=1;j<n;j++)
            d[i][j]=INF;
    for(int i=1;i<(1<<n);i++)
        for(int j=1;j<n;j++)
            if(i&(1<<j))
                for(unsigned k=0;k<a[j].size();k++)
                    if(i&(1<<a[j][k].first))
                        d[i][j]=min(d[i][j],d[i-(1<<j)][a[j][k].first]+a[j][k].second);
    int sol=INF;
    for(unsigned k=0;k<a[0].size();k++)
        sol=min(sol,d[(1<<n)-1][a[0][k].first]+a[0][k].second);
    if(sol==INF)
        out<<"Nu exista solutie";
    else
        out<<sol;
    return 0;
}