import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x > arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x < arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}


enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;


void main() {
    int N, M;
    scan(N, M);

    auto cost = new int[][](N, N);
    fillAll(cost, inf);
    foreach (i ; 0 .. M) {
        int u, v, d;
        scan(u, v, d);
        cost[u][v] = d;
    }

    auto dp = new int[][](1 << N, N);
    fillAll(dp, inf);
    foreach (i ; 1 .. N) {
        dp[1 << i][i] = cost[0][i];
    }

    foreach (mask ; 0 .. 1 << N) {
        foreach (u ; 0 .. N) if (mask & 1 << u) {
            auto sub = mask ^ 1 << u;
            foreach (v ; 0 .. N) if (sub & 1 << v) {
                chmin(dp[mask][u], dp[sub][v] + cost[v][u]);
            }
        }
    }

    auto ans = dp[(1 << N) - 1][0];
    if (ans == inf) ans = -1;
    writeln(ans);
}

