#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>

using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "YES" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "NO" << endl;  \
    }
#define IFYes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "Yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "No" << endl;  \
    }
#define IFyes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "no" << endl;  \
    }
#define DEBUG_OUTPUT_ARRAY(XXX, ONE)                            \
    for (int i = 0; i < (ONE); i++)                             \
    {                                                           \
        cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
    }
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO)                             \
    for (int i = 0; i < (ONE); i++)                                    \
    {                                                                  \
        cout << "<<< i = " << i << " >>>" << endl;                     \
        for (int j = 0; j < (TWO); j++)                                \
        {                                                              \
            cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
        }                                                              \
    }
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
    for (int i = 0; i < (ONE); i++)            \
    {                                          \
        cout << i << "  ";                     \
        for (int j = 0; j < (TWO); j++)        \
        {                                      \
            cout << XXX[i][j] << " ";          \
        }                                      \
        cout << endl;                          \
    }

typedef pair<long long int, long long int> pll;


const long long int mod = 1000000007;
const long long int INF = 1e18;
long long int V,E,s[2000],t[2000],d[2000];
long long int dp[100000][16]={},edge[30][30]={};

void dfs(long long int now){

}

int main()
{
    cout << fixed << setprecision(18);
    cin>>V>>E;
    for(long long int i = 0; i < 20; i++){
        for(long long int j = 0; j < 20; j++){
            edge[i][j]=INF;
        }
    }
    for(long long int i = 0; i < E; i++){
        cin>>s[i]>>t[i]>>d[i];
        edge[s[i]][t[i]]=d[i];
        //edge[t[i]][s[i]]=d[i];
    }

    for(long long int i = 0; i < (1<<V); i++){
        for(long long int j = 0; j < V; j++){
            dp[i][j]=INF;
        }
    }
    dp[0][0]=0;
    
    for(long long int i = 0; i < (1<<V); i++){
        for(long long int j = 0; j < V; j++){
            for(long long int k = 0; k < V; k++){
                if((i&(1<<k))==0)dp[i|(1<<k)][k] = min(dp[i|(1<<k)][k],dp[i][j]+edge[j][k]);
            }
        }
    }
    long long int res=dp[(1<<V)-1][0];
    if(res==INF){res=-1;}
    cout<<res<<endl;
}



Measured memory_bytes: 7204