#include <fstream>
#define DMAX 20
#define INF 2000000000

using namespace std;
ifstream fin ("hamilton.in");
ofstream fout ("hamilton.out");

void citire();
void rez();
void bkt(int);
void afisare();

int n, m;
int C[DMAX][DMAX];
int sol[DMAX], cost;
int solmin[DMAX], costmin=INF;
bool use[DMAX];

int main()
{
    citire();
    rez();
    afisare();
    
    fin.close();
    fout.close();
    return 0;
}

void citire()
{
    int i, a, b, cost;
    
    fin>> n>> m;
    for (i=1; i<=m; i++)
    {
        fin>> a>> b>> cost;
        C[a+1][b+1]=cost;
    }
}

void rez()
{
    cost=0;
    sol[1]=1;
    use[1]=1;
    bkt(2);
}

void bkt(int poz)
{
    int i;
    
    if (cost>costmin) return;
    
    if (poz==n+1 && C[sol[n]][1])
    {
        cost+=C[sol[n]][1];
        
        if (cost<costmin)
        {
            costmin=cost;
            for (i=1; i<=n; i++) solmin[i]=sol[i];
        }
        
        cost-=C[sol[n]][1];
        return;
    }
    
    for (i=1; i<=n; i++)
        if (!use[i] && C[sol[poz-1]][i])
        {
            sol[poz]=i;
            cost+=C[sol[poz-1]][i];
            use[i]=1;
            
            bkt(poz+1);
            
            cost-=C[sol[poz-1]][i];
            use[i]=0;
        }
}

void afisare()
{
    if (costmin == INF)
        fout<< "Nu exista solutie\n";
    else
        fout<< costmin<< '\n';
}