#include <iostream>

 #include <cstdio>

 #include <cstdlib>

 #include <cstring>

 #include <algorithm>

 #include <sstream>

 #include <vector>

 #include <string>

 #include <cmath>

 #define min(a, b) ((a) < (b) ? (a) : (b))

 #define max(a, b) ((a) > (b) ? (a) : (b))

 inline void swap(int &a, int &b)

 {

     int tmp = a;a = b;b = tmp;

 }

 inline void read(int &x)

 {

     x = ;char ch = getchar(), c = ch;

     while(ch < '' || ch > '')c = ch, ch = getchar();

     while(ch <= '' && ch >= '')x = x *  + ch - '', ch = getchar();

     if(c == '-')x = -x;

 }

 const int INF = 0x3f3f3f3f;

 const int MAXN =  + ;

 const int MAXM =  + ;

 const int MAXS = ;

 struct Edge

 {

     int u,v,nxt;

     Edge(int _u, int _v, int _nxt){u = _u;v = _v;nxt = _nxt;}

     Edge(){}

 }edge[MAXN << ];

 int head[MAXN], cnt;

 inline void insert(int a, int b)

 {

     edge[++cnt] = Edge(a,b,head[a]);

     head[a] = cnt;

 }

 int m,n,s,c[MAXN + MAXM],a[MAXN + MAXM],dp[MAXN + MAXM][ << MAXS][ << MAXS],ma;

 std::string ch;

 int DP(int i, int s0, int s1, int s2)

 {

     if(i > n + m) return s2 == ma -  ?  : INF;

     if(dp[i][s1][s2] >= )return dp[i][s1][s2];

     dp[i][s1][s2] = INF;

     if(i > m) dp[i][s1][s2] = DP(i + , s0, s1, s2);

     int tmp1 = s0 & a[i], tmp2 = s1 & a[i];

     dp[i][s1][s2] = min(dp[i][s1][s2], DP(i + , s0^tmp1, (s1 ^ tmp2) | tmp1, s2 | tmp2) + c[i]);

     return dp[i][s1][s2];

 }

 int main()

 {

     while(scanf("%d %d %d", &s, &m, &n) != EOF && n + m + s)

     {

         std::cin.get();

         memset(dp, -, sizeof(dp));

         memset(a, , sizeof(a));

         int tmp;

         for(register int i = ;i <= m + n;++ i)

         {

             getline(std::cin, ch);

             std::stringstream cc(ch);

             cc >> c[i];

             a[i] = ;

             while(cc >> tmp)

                 a[i] |=  << (tmp - );

         }

         ma =  << s;

         printf("%d\n", DP(, ma - , , ));

     }

     return ;

 }