#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <map>

using namespace std;

template <class T> void chmin(T& a, const T b){a=min(a,b);}

int main(void) {
    int T,N,M;
    scanf("%d",&T);
    scanf("%d%d",&N,&M);
    map<pair<int,int>,long long> edges;
    while(M--) {
        int u,v,w;
        scanf("%d%d%d",&u,&v,&w);
        u--,v--;
        if(T) {
            edges[{u,v}]=w;
        }
        else {
            edges[{u,v}]=edges[{v,u}]=w;
        }
    }
    long long inf = 1e15;
    long long ans = inf;
    vector<int> idx(N);
    iota(idx.begin(),idx.end(),0);
    do{
        long long sum = 0;
        int root = idx.front();
        for(int i=0;i<N;++i) {
            int u = idx[i];
            int v = idx[(i+1)%N];

            if(2 <= i && edges.count({u,root})) {
                chmin(ans,sum + edges[{u,root}]);
            }

            if(edges.count({u,v})) sum += edges[{u,v}];
            else break;
        }
    } while(next_permutation(idx.begin(),idx.end()));
    if(ans == inf) ans = -1;
    printf("%lld\n",ans);
}