#include <iostream>
#include <vector>
#include <cstring>
#include <cstdio>
#define inf 0x3f3f3f3f
#define min(a, b) a<b?a:b
#define N 27000

using namespace std;

vector <pair<int, int> > graf[19];
vector <pair<int, int> >::iterator it;
int n, m, d[19][N], viz[19];

void citire()
{
    scanf("%d %d\n", &n, &m);
    for(int i=0;i<m;i++)
    {
        int x, y, c;
        scanf("%d %d %d\n", &x, &y, &c);
        graf[y].push_back(make_pair(x, c));
    }
    for(int i=0;i<18;i++)
        for(int j=0;j<27000;j++)
            d[i][j]=inf;
    d[0][1]=0;
}

int main()
{
    freopen("hamilton.in", "r", stdin);
    freopen("hamilton.out", "w", stdout);

    citire();
    for(int drum=0;drum<(1<<n);drum++)
    {
        for(int nod=0;nod<n;nod++)
            if(drum&(1<<nod))
                for(it=graf[nod].begin();it!=graf[nod].end();it++)
                    if(drum^(1<<(it->first))==0)
                        d[nod][drum]=min(d[nod][drum], d[it->first][drum^(1<<nod)] + it->second);
    }
    int minim=inf;
    for(it=graf[0].begin();it!=graf[0].end();it++)
        minim=min(minim, d[it->first][(1<<n)-1] + it->second);
    if(minim==inf)
        printf("Nu exista solutie");
    else
        printf("%d", minim);
    return 0;
}