////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <vector>
#include <queue>
#include <string>
#include <complex>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <regex>
using namespace std;

//// MACRO ////
#define countof(a) (sizeof(a)/sizeof(a[0]))

#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int i = (s); i < (n); i++)
#define RFOR(i,s,n) for (int i = (n)-1; i >= (s); i--)
#define pos(c,i) c.being() + (i)
#define allof(c) c.begin(), c.end()
#define aallof(a) a, countof(a)
#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)
#define apartof(a,i,n) a + (i), a + (i) + (n)
#define long long long

#define EPS 1e-9
#define INF (1L << 30)
#define LINF (1LL << 60)

#define PREDICATE(t,a) (const t & a) -> bool
#define COMPARISON_T(t) bool(*)(const t &, const t &)
#define COMPARISON(t,a,b) (const t & a, const t & b) -> bool
#define CONVERTER(TSrc,t,TDest) (const TSrc &t)->TDest

//// i/o helper ////

struct _Reader { template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };
struct _Writer { bool f; _Writer() : f(false) { } template <class T> _Writer operator ,(const T &rhs) { cout << (f ? " " : "") << rhs; f = true; return *this; } };
#define READ(t,...) t __VA_ARGS__; _Reader(), __VA_ARGS__
#define WRITE(...) _Writer(), __VA_ARGS__; cout << endl
inline int sign(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }

template <class T> struct vevector : public vector<vector<T>> { vevector(int n = 0, int m = 0, const T &initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };
template <class T> struct vevevector : public vector<vevector<T>> { vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };
template <class T> struct vevevevector : public vector<vevevector<T>> { vevevevector(int n = 0, int m = 0, int l = 0, int k = 0, const T &initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };
template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; REP(i, n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; }
template <class T> vector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i, n) v.push_back(readjag<T>()); return v; }

template <class T1, class T2> inline istream & operator >> (istream & in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; }
template <class T1, class T2> inline ostream & operator << (ostream &out, pair<T1, T2> &p) { out << p.first << p.second; return out; }
template <class T> inline ostream & operator << (ostream &out, vector<T> &v)
{
	ostringstream ss;
	for (auto x : v) ss << x << ' ';
	auto s = ss.str();
	out << s.substr(0, s.length() - 1) << endl;
	return out;
}


//// bit ////
#ifdef _MSC_VER
#pragma push_macro("long")
#undef long
inline unsigned __builtin_ctz(unsigned x) { unsigned long r; _BitScanForward(&r, x); return r; }
inline unsigned __builtin_clz(unsigned x) { unsigned long r; _BitScanReverse(&r, x); return 31 - r; }
inline unsigned __builtin_ffs(unsigned x) { unsigned long r; return _BitScanForward(&r, x) ? r + 1 : 0; }
inline unsigned __builtin_ctzll(unsigned long long x) { unsigned long r; _BitScanForward64(&r, x); return r; }
inline unsigned __builtin_clzll(unsigned long long x) { unsigned long r; _BitScanReverse64(&r, x); return 63 - r; }
inline unsigned __builtin_ffsll(unsigned long long x) { unsigned long r; return _BitScanForward64(&r, x) ? r + 1 : 0; }
inline unsigned int __builtin_popcount(unsigned int x){ return __popcnt(x); }
inline unsigned long long __builtin_popcountll(unsigned long long x) { return __popcnt64(x); }

#pragma pop_macro("long")
#endif
inline int bsf(int v) { return __builtin_ctz(v); }
inline long bsf(long v) { return __builtin_ctzll(v); }
inline int bsr(int v) { return 31 - __builtin_clz(v); }
inline long bsr(long v) { return 63 - __builtin_clzll(v); }
inline int msb(int v) { return 1 << bsr(v); }
inline long msb(long v) { return 1ll << bsr(v); }
inline int lsb(int v) { return v & -v; }
inline long lsb(long v) { return v & -v; }
inline int pop_lsb(int v) { return v & v - 1; }
inline long pop_lsb(long v) { return v & v - 1; }

//// idconv ////
template<class T>
struct idconv
{
	vector<T> v;
	int get(T t)
	{
		int id = (int)(find(allof(v), t) - v.begin());
		if (id == v.size()) v.push_back(t);
		return id;
	}
};

//// start up ////
void solve();
int main()
{
	solve();
	return 0;
}

////////////////////
/// template end ///
////////////////////

inline long bit(int i) { return 1ll << i; }

int dfs(const vector<pair<int, long>> &nations, long cand, map<long, int> &memo)
{
	if (!cand) return 0;
	if (memo.count(cand)) return memo[cand];
	pair<int, long> d = nations[bsf(cand)];
	int use = dfs(nations, cand & ~d.second, memo) + d.first;
	int notuse = dfs(nations, pop_lsb(cand), memo);
	return memo[cand] = max(use, notuse);
}

void solve()
{
	int testcases = INF;
	REP(testcase, testcases)
	{
		READ(int, N);
		if (!N) { break; }

		vector<bitset<64>> adj(N);
		vector<pair<int, long>> nations(N);
		idconv<string> idc;
		REP(i, N)
		{
			int id = idc.get(read<string>());
			int pw = read<int>();
			long a = bit(id);
			for (auto &s : readjag<string>()) a |= bit(idc.get(s));
			adj[id] = a;
			nations[id] = make_pair(pw, a);
		}

		int sum = nations[0].first;
		long candidate = bit(N) - 1 & ~nations[0].second;

		// グラフ分割
		REP(k, N) REP(i, N) REP(j, N) adj[i][j] = adj[i][j] | (adj[i][k] & adj[k][j]);

		REP(i, N)
		{
			long cand = candidate & adj[i].to_ullong();
			if (cand)
			{
				map<long, int> memo;
				sum += dfs(nations, cand, memo);
				candidate &= ~cand;
			}
		}
		WRITE(sum);
	}
}

Measured memory_bytes: 1788