#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
 
using namespace std;
 
#if __GNUC__
#include <tr1/unordered_map>
#include <tr1/unordered_set>
using namespace tr1;
#else
#include <unordered_map>
#include <unordered_set>
#endif

#ifdef __GNUC__
template <class T> int popcount(T n);
template <> int popcount(unsigned int n) { return __builtin_popcount(n); }
template <> int popcount(int n) { return __builtin_popcount(n); }
template <> int popcount(unsigned long long n) { return __builtin_popcountll(n); }
template <> int popcount(long long n) { return __builtin_popcountll(n); }
#else
#define __typeof__ decltype
template <class T> int popcount(T n) { return n ? 1 + popcount(n & (n - 1)) : 0; }
#endif
 
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define COPY(dest, src) memcpy(dest, src, sizeof(src))

template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }
 
typedef long long ll;
typedef pair<int, int> pint;
 
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
 
const double EPS = 1e-8;
const double PI = acos(-1.0);
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
bool valid_pos(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }
 
template <class T> void print(T a, int n, int br = 1, const string& deli = ", ") { cout << "{ "; for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } cout << " }"; while (br--) cout << endl; }
template <class T> void print(const vector<T>& v, int br = 1, const string& deli = ", ") { print(v, v.size(), br, deli); }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) {	if (width != -1) cout.width(width); cout << a[i][j] << ' ';	} cout << endl; } while (br--) cout << endl; }
 
template <class T> void input(int n, T& a) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T, class U> void input(int n, T& a, U& b) { for (int i = 0; i < n; ++i) cin >> a[i] >> b[i]; }



bool used[43];

int m, force[43];
ll on[43];
void init_subgraph(const vector<vector<int> >& g, const vector<int>& f, int s)
{
	CL(on, 0);
	map<int, int> id;
	id[s] = 0;

	queue<int> q;
	q.push(s);
	while (!q.empty())
	{
		int p = q.front();
		q.pop();

		used[p] = true;

		int no = id[p];
		force[no] = f[p];
		on[no] = 1LL << no;
		for (int i = 0; i < g[p].size(); ++i)
		{
			int t = g[p][i];
			if (!id.count(t))
			{
				int tt = id.size();
				id[t] = tt;
				q.push(t);
			}
			on[no] |= 1LL << id[t];
		}
	}

	m = id.size();
}

int max_f;
void dfs(int d, ll enemy, int sum)
{
	if (d == m)
	{
		max_swap(max_f, sum);
		return;
	}

	if (!(enemy >> d & 1))
	{
		int rem = 0;
		for (int i = d; i < m; ++i)
			if (!(enemy >> i & 1))
				rem += force[i];
		if (sum + rem <= max_f)
			return;

		dfs(d + 1, enemy | on[d], sum + force[d]);
	}
	dfs(d + 1, enemy, sum);
}
int main()
{
	ios::sync_with_stdio(false);

	int n;
	while (cin >> n, n)
	{
		CL(used, 0);

		vector<vector<int> > g(n);
		vector<int> f(n);
		map<string, int> id;

		rep (_, n)
		{
			string a;
			int b, c;
			cin >> a >> b >> c;
			if (!id.count(a))
			{
				int t = id.size();
				id[a] = t;
			}
			int v = id[a];
			f[v] = b;

			while (c--)
			{
				string d;
				cin >> d;
				if (!id.count(d))
				{
					int t = id.size();
					id[d] = t;
				}
				int u = id[d];
				g[v].push_back(u);
			}
		}


		int res;
		
		init_subgraph(g, f, 0);
		max_f = 0;
		dfs(1, on[0], force[0]);
		res = max_f;

		for (int i = 0; i < n; ++i)
		{
			if (!used[i])
			{
				init_subgraph(g, f, i);
				max_f = 0;
				dfs(0, 0, 0);
				res += max_f;
			}
		}

		cout << res << endl;
	}
}

Measured memory_bytes: 952