#include <cstdio>
#define DMAX 20
#define INF 2000000000
using namespace std;

int sol[DMAX], solmin[DMAX], cost, costmin;
int G[DMAX][DMAX];
bool uz[DMAX];
int n, m;


void citire();
void gen (int);
void afisare();
void init();

int main()
{
    citire();
    sol[1]=1;
    init();
    gen (2);
    afisare();
    return 0;
}

void citire()
{
    FILE*fin=fopen ("hamilton.in", "r");
    int i;
    int a, b, c;
    fscanf(fin, "%d %d", &n, &m);
    for (i=1; i<=m; ++i)
    {
        fscanf(fin, "%d %d %d", &a, &b, &c);
        ++a; ++b;
        G[a][b]=G[b][a]=c;
    }
    fclose(fin);
    return;
}

void init()
{
    costmin=INF;
    int i, j;
    for (i=1; i<=n; ++i)
        for (j=i+1; j<=n; ++j)
            if (!G[i][j])
                G[i][j]=G[j][i]=INF;
    return;
}

void gen (int k)
{
    int i;
    if (cost>costmin) return;
    if (k==n+1 && G[sol[n]][1]!=INF) //am completat tot
    {
        cost+=G[sol[n]][1];
        if (cost<costmin)
        {
            costmin=cost;
            for (i=1; i<=n; ++i)
                solmin[i]=sol[i];
        }
        cost-=G[sol[n]][1];
        return;
    }
    for (i=2; i<=n; ++i)
        if (!uz[i] && G[i][sol[k-1]]!=INF)
    {
        uz[i]=true;
        sol[k]=i;
        cost+=G[sol[k-1]][i];
        gen (k+1);
        uz[i]=false;
        cost-=G[sol[k-1]][i];
    }
}

void afisare()
{
    FILE*fout=fopen ("hamilton.out", "w");
    fprintf(fout, "%d\n", costmin);
    fclose(fout);
    return;
}