#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

const int INF=20000000;

struct graf
{
    int nod,cost;
};

vector<graf> v[20];
int d[(1<<18)+10][20];

int main()
{
    freopen("hamilton.in","r",stdin);
    freopen("hamilton.out","w",stdout);
    int sol=INF,n,m,x,y,c,nod,cost,p;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        v[x].push_back({y,c});
    }
    for(int mask=1;mask<(1<<n);mask++)
        for(int i=0;i<n;i++)
            d[mask][i]=INF;
    d[1][0]=0;
    for(int mask=1;mask<(1<<n);mask++)
        for(int i=0;i<n;i++)
            if(mask&(1<<i))
                for(int j=0;j<v[i].size();j++)
                {
                    nod=v[i][j].nod;
                    cost=v[i][j].cost;
                    if((mask&(1<<nod))==0)
                        d[mask+(1<<nod)][nod]=min(d[mask+(1<<nod)][nod],d[mask][i]+cost);
                }
    for(int i=1;i<n;i++)
    {
        p=0;
        for(int j=0;j<v[i].size();j++)
            if(v[i][j].nod==0) {p=v[i][j].cost;break;}
        if(p>0) sol=min(sol,d[(1<<n)-1][i]+p);
    }
    if(sol==INF) printf("Nu exista solutie");
    else printf("%d",sol);
    return 0;
}