#include <bits/stdc++.h>
template<class T> inline void chmin(T &a,T b){if(a > b) a = b;}
#define REP(i,n) for(int i=0;i<n;++i)

using namespace std;
using ll = long long;
constexpr int INF = 1e9;

int dp[1 << 16][16];
int V,E,s,t,d;

struct Edge {
    int to,cost;
    Edge(int to,int cost) : to(to), cost(cost){}
};

using Graph = vector<vector<Edge> >;

int main(){
    cin >> V >> E;
    Graph g(V);
    REP(i,E){
        cin >> s >> t >> d;
        g[s].emplace_back(t,d);
    }
    REP(i,1<<V) REP(j,V) dp[i][j] = INF;
    dp[(1<<V)-1][0] = 0; // start is 0
    for(int i = (1<<V)-2; i >= 0; --i){
        // x to somewhere
        for(int v = 0; v < V; ++v){
            for(Edge e : g[v]){
                int nv = e.to;
                int nc = e.cost;
                if(!(i & (1<<nv))){
                    chmin(dp[i][nv],dp[i | (1<<nv)][v] + nc);
                }
            }
        }
    }
    cout << (dp[0][0]==INF ? -1 : dp[0][0]) << endl;
    return 0;
}


