#include <bits/stdc++.h>
 
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(a) (a).begin(),(a).end()
 
using namespace std;
using ll  = long long;
using pll = pair<ll, ll>;
 
const ll MOD  = 1e9+7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;

int main(){
    int v, e;
    cin >> v >> e;

    ll dist[v][v];//dist[i][j]:iとjを結ぶ辺の距離、
    rep(i, v)rep(j, v)dist[i][j] = INF;

    rep(i, e){
        int s, t, d;
        cin >> s >> t >> d;

        dist[s][t] = d;
    }

    ll dp[(1<<v)][v];//dp[r][i]:集合r(立っているbitの番号の辺が訪問済)から頂点iへ行くときの最短距離
    rep(i, (1<<v))rep(j, v)dp[i][j] = INF;

    dp[0][0] = 0;
    rep(r, (1<<v)){
        rep(i, v){
            if(r&(1<<i)){
                rep(j, v)dp[r][i] = min(dp[r][i], dp[r-(1<<i)][j]+dist[j][i]);
            }
        }
    }

    ll ans = dp[(1<<v)-1][0];
    if(ans >= INF)cout << -1 << endl;
    else cout << ans << endl;
}
