#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;
template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
#define MOD 1000000007LL
//#define MOD 998244353LL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}
#define rep(i,n) for(lint i=0;i<lint(n);++i)
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrep(i,n) for(lint i=lint(n)-1;i>=0;--i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
#define all(n) begin(n),end(n)
#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))
inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}
inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
auto call=[](auto f,auto... args){return f(f,args...);};


 
int main(){
    while(1){
        lint n;
        cin>>n;
        if(n==0)break;
        map<string,lint>m;
        vector<vector<string>>s(n);
        vector<lint>v(n);
        rep(i,n){
            string t;
            cin>>t;
            m[t]=i;
            cin>>v[i];
            lint x;
            cin>>x;
            rep(j,x){
                string u;
                cin>>u;
                s[i].push_back(u);
            }
        }
        mat g(n);
        rep(i,n){
            rep(j,s[i].size()){
                g[i].push_back(m[s[i][j]]);
            }
        }
        lint k=n/2;
        lint* tmp=new lint[1LL<<k]();
        lint* tmp2=new lint[1LL<<(n-k)]();
        rep(i,1LL<<k){
            bool b=i&1LL;
            if(!b)continue;
            lint cnt=0;
            rep(j,k){
                if(i&(1LL<<j)){
                    for(auto e:g[j]){
                        if(e>=k)continue;
                        if(i&(1LL<<e)){
                            b=0;
                            if(b==0)break;
                        }
                    }
                    cnt+=v[j];
                }
                if(b==0)break;
            }
            if(b)tmp[i]=cnt;
        }
        rep(t,1LL<<(n-k)){
            lint i=t<<k;
            bool b=1;
            lint cnt=0;
            rep(j,(n-k)){
                if(i&(1LL<<(j+k))){
                    for(auto e:g[j+k]){
                        if(i&(1LL<<e))b=0;
                        if(b==0)break;
                    }
                    cnt+=v[j+k];
                }
                if(b==0)break;
            }
            if(b)tmp2[t]=cnt;
        }
        rep(i,1LL<<(n-k)){
            rep(j,(n-k)){
                if(i&(1LL<<j)){
                    tmp2[i]=max(tmp2[i],tmp2[i-(1LL<<j)]);
                }
            }
        }
        lint ans=0;
        vector<lint>hoge(k,0);
        rep(i,k){
            for(auto e:g[i]){
                if(e<k)continue;
                hoge[i]|=1LL<<(e-k);
            }
        }
        rep(i,1LL<<k){
            if(tmp[i]==0)continue;
            lint mask=(1LL<<(n-k))-1;
            rep(j,k){
                if(i&(1LL<<j)){
                    mask&=~hoge[j];
                }
            }
            ans=max(ans,tmp[i]+tmp2[mask]);
        }
        cout<<ans<<endl;
        delete[] tmp;
        delete[] tmp2;
    }
}


Measured memory_bytes: 19528