// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=()=>readln.chomp();
void dprint(L...)(lazy L A){debug{auto l=new string[](L.length);static foreach(i,a;A)l[i]=a.text;arywrite(l);}}
static immutable MOD=10^^9+7;alias PQueue(T,alias l="b<a")=BinaryHeap!(Array!T,l);import std, core.bitop;
// dfmt on

void main()
{
    long N, M;
    scan(N, M);
    auto C = new ulong[](M);
    auto A = new long[](M);
    foreach (i; 0 .. M)
    {
        long a, b;
        scan(a, b);
        auto cs = aryread();
        A[i] = a;
        foreach (c; cs)
        {
            C[i] = C[i] | (1 << (c - 1));
        }
    }
    auto dp = new long[][](M + 1, 1 << N);
    foreach (i; 0 .. M + 1)
        dp[i][] = long.max / 4;
    dp[0][0] = 0;
    foreach (i; 0 .. M)
        foreach (ulong s; 0UL .. 1UL << N)
        {
            dp[i + 1][s] = dp[i + 1][s].min(dp[i][s]);
            dp[i + 1][s | C[i]] = dp[i + 1][s | C[i]].min(dp[i][s] + A[i]);
        }
    writeln(dp[M][$ - 1] == long.max / 4 ? -1 : dp[M][$ - 1]);
}
