#include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
#include <fstream>
#include <cassert>
using namespace std;

//common
typedef int  i32;
typedef long long i64,ll;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs; typedef long double ld;

#define BR "\n"
#define ALL(c) (c).begin(),(c).end()
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)
#define IN(l,v,r) ((l)<=(v) && (v)<(r))

//config
//#undef NDEBUG
//#define INF 1<<30
//#define EPS 1e-8
//const ll MOD =100000007;

//debug
#ifdef NDEBUG
#define DUMP(x)
#define DUMPLN(x)
#define DEBUG(x)
#define DEBUGLN(x)
#define LINE()
#define LINELN()
#define CHECK(exp,act)
#define STOP(e)
#else
#define DUMP(x)  cerr << #x << " = " << (x)
#define DUMPLN(x)  DUMP(x) <<endl
#define DEBUG(x) DUMP(x) << LINE() << " " << __FILE__
#define DEBUGLN(x) DEBUG(x)<<endl
#define LINE()    cerr<< " (L" << __LINE__ << ")"
#define LINELN()    LINE()<<endl
#define CHECK(exp,act)  if(exp!=act){DUMPLN(exp);DEBUGLN(act);}
#define STOP(e)  CHECK(e,true);if(!(e)) exit(1);
#endif

template<class T> inline string toString(const vector<T>& x) {
	stringstream ss;
	REP(i,x.size()){
		if(i!=0)ss<<" ";
		ss<< x[i];
	}
	return ss.str();
}

template<class T> inline string toString(const vector<vector<T> >& map) {
	stringstream ss;
	REP(i,map.size()){
		if(i!=0)ss<<BR;
		ss<< toString(map[i]);
	}
	return ss.str();
}
template<class K,class V>  string toString(map<K,V>& x) {
	string res;stringstream ss;
	for(auto& p:x)ss<< p.first<<":" << p.second<<" ";
	return ss.str();
}

string BITtoString(int bit){
    stringstream ss;
    while(bit!=0){ss<<(bit%2);bit/=2;}
    string res=ss.str();reverse(ALL(res));
    return res;
}

template<typename T,typename V> inline T mod(T v,V MOD){
	return (v%MOD+MOD)%MOD;
}

class Main{
public:

	int N;
	vector<int> ps;
	vector<vector<int>> es;
	vector<bool> canselect;
	vector<int> fillc;

	int Mv;	
	int must;

	vector<bool> change;
	void dfs(int v,int val){
		//DUMP(v);
		Mv=max(Mv,val);
		if(v>=N)return;
		if(val+fillc[v]<=Mv)return;
		if(canselect[v]){
			vector<int> change;
			select(v,change);
			dfs(v+1,val+ps[v]);
			unselect(v,change);
			//周りが全て固定されていれば未選択の必要はない
			if(!allfixed(v))dfs(v+1,val);
		}else{
			dfs(v+1,val);
		}
	}

	bool allfixed(int v){
		REP(i,es[v].size())if(es[v][i]>v)return false;
		return true;
	}

	void select(int v,vector<int>& change){
		canselect[v]=false;
		REP(i,es[v].size()){
			if(canselect[es[v][i]]){
				canselect[es[v][i]]=false;
				change.push_back(es[v][i]);
			}
		}
	}
	void unselect(int v,vector<int>& change){
		canselect[v]=true;
		REP(i,change.size())canselect[change[i]]=true;
	}

	void run(){
		//ifstream fin("in" );
		//ofstream fout( "out" );
		while(true){
			cin >>N;
			if(N==0)break;
			vector<string> cs(N);
			map<string,int> stoid;
			ps=vector<int>(N);
			vector<vector<string>> ess(N);
			REP(i,N){
				cin >> cs[i] >> ps[i];stoid.insert(make_pair(cs[i],i));
				
				int k;cin >>k;
				REP(j,k) {
					string s;cin >> s;ess[i].push_back(s);
				}
			}
			
			es=vector<vector<int>>(N);
			REP(i,N)REP(j,ess[i].size())es[i].push_back(stoid[ess[i][j]]);
		
			canselect=vector<bool>(N,true);
			fillc=vector<int>(N+1);
			for(int i=N-1;i>=0;i--)fillc[i]+=fillc[i+1]+ps[i];

			//自分
			vector<int> dummy;
			must=ps[0];select(0,dummy);
			//孤立点
			REP(i,N)if(canselect[i] && es[i].size()==0){must+=ps[i];select(i,dummy);}
			
			Mv=must;
			dfs(0,must);

			cout<< Mv<<endl;
		}
	}
};
 int main(){
 	Main().run();
 	return 0;
 }

Measured memory_bytes: 1400