using System;
using System.Collections.Generic;
using static Assistant.Input;
using System.Linq;
using Assistant;

namespace Temp20200521
{
    class Program
    {
        static void Main(string[] args)
        {
            N = ReadInt;
            M = ReadInt;

            a = new int[M];
            b = new int[M];
            c = new int[M][];
            for (int i = 0; i < M; i++)
            {
                a[i] = ReadInt;
                b[i] = ReadInt;
                c[i] = ReadInts.Select(x => x - 1).ToArray();
            }

            //bitDP
            dp = new int[1 << N];//頂点、鍵
            for (int i = 0; i < 1 << N; i++)
            {
                    dp[i] = int.MaxValue / 2;
            }
            dp[(1 << N) - 1] = 0;

            for (int i = (1 << N) - 1; i >= 0; i--)
            {
                for (int j = 0; j < M - 1; j++)
                {
                    int next = i;
                    for (int k = 0; k < c[j].Length; k++)
                    {
                        next = next | (1 << c[j][k]);
                    }

                    dp[i] = Math.Min(dp[i], dp[next] + a[j]);
                }
            }

            int ans = dp[0];
            //int ans = DP(0, 0);
            if (ans == int.MaxValue / 2) ans = -1;
            Console.WriteLine(ans);

            //DrawMapforDebug(dp, 1);
        }

        static int N, M;
        static int[] a, b;
        static int[][] c;
        static int[] dp;
        //再帰バージョンを書いてみる
        //static int DP(int S, int v)
        //{
        //    if (S == (1 << N) - 1)
        //    {
        //        return 0;
        //    }
        //    if (dp[S, v] != int.MaxValue / 2) return dp[S, v];

        //    int next = S;
        //    for (int k = 0; k < c[v].Length; k++)
        //    {
        //        next = next | (1 << c[v][k]);
        //    }

        //    dp[S, v] = Math.Min(dp[S, v], DP(next, v - 1) + a[v]);

        //    return dp[S, v];
        //}

        /// <summary>
        /// 二次元配列の可視化メソッド
        /// </summary>
        /// <param name="map"></param>
        static void DrawMapforDebug(int[,] map, int mode = 0)
        {
            int W = map.GetLength(0);
            int H = map.GetLength(1);

            int[,] map2 = new int[W + 1, H + 1];
            for (int i = 0; i < W + 1; i++)
            {
                for (int j = 0; j < H + 1; j++)
                {
                    if (i == 0 && j == 0) map2[i, j] = 0;
                    else if (i == 0) map2[i, j] = j - 1;
                    else if (j == 0) map2[i, j] = i - 1;
                    else map2[i, j] = map[i - 1, j - 1];
                }
            }

            for (int i = 0; i < W + 1; i++)
            {
                for (int j = 0; j < H + 1; j++)
                {
                    if (mode == 0) Console.Write(map2[i, j] % 10);
                    else Console.Write(map2[i, j] + " ");
                }
                Console.WriteLine();
            }
            Console.WriteLine();
        }
    }


}

namespace Assistant
{
    static class Input
    {
        static List<string> line = new List<string>();
        static int index = 0;
        static String ReadNext()
        {
            if (line.Count <= index) line.AddRange(Console.ReadLine().Split());
            return line[index++];
        }
        public static int ReadInt => int.Parse(ReadNext());
        public static long ReadLong => long.Parse(ReadNext());
        public static int[] ReadInts => Console.ReadLine().Split().Select(int.Parse).ToArray();
        public static long[] NextLongs => Console.ReadLine().Split().Select(long.Parse).ToArray();
    }
}


Measured memory_bytes: 13652