#include <bits/stdc++.h>
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t ...Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t ...Args> using mdarray = typename multi_dem_array<T, Args...>::type;
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }

namespace graph {

using Node = ll;
using Weight = ll;
using Edge = std::pair<Node, Weight>;

template <bool Directed>
struct Graph : public vvec<Edge> {
    using vvec<Edge>::vvec;

    void add_edge(Node f, Node t, Weight w = 1) {
        (*this)[f].emplace_back(t, w);
        if (!Directed) (*this)[t].emplace_back(f, w);
    }

    Graph<Directed> build_inv() const {
        Graph<Directed> ret(this->size());
        for (Node i = 0; i < this->size(); i++) {
            for (const Edge &e : (*this)[i]) {
                Node j;
                Weight w;
                std::tie(j, w) = e;
                if (!Directed && j < i) continue;
                ret.add_edge(j, i, w);
            }
        }

        return ret;
    }
};

}

constexpr static std::size_t half = (40 + 1) / 2;
constexpr static std::size_t hsz = (1ll << half);
std::array<ll, hsz> halfg;
vec<ll> pows;

namespace graph {

template <std::size_t Size>
class IndependentSet {
    vvec<ll> dp;
    const std::size_t gsz;
    std::array<ll, Size> bs_graph;

    void build_neigh(std::array<ll, hsz> &gr, std::size_t sz) {
        for (ll i = 0; i < sz; i++) {
            ll mask = 1ll << i;
            for (ll s = 0; s < (1ll << sz); s++) if (s & mask) gr[s] |= gr[s ^ mask];
        }
    }

    void calc_sz(vec<ll> &sz_v, std::array<ll, hsz> &gr, std::size_t sz, int offset) {
        std::fill(ALL(sz_v), 0);
        build_neigh(gr, sz);
        for (ll s = 0; s < sz_v.size(); s++) {
            ll e = gr[s];
            if (s & e) continue;
            for (int i = 0; i < sz; i++) if (s & (1ll << i)) sz_v[s] += pows[offset + i];
        }
        for (ll i = 0; i < sz; i++) {
            ll mask = 1ll << i;
            for (ll s = 0; s < (1ll << sz); s++) if (s & mask) chmax(sz_v[s], sz_v[s ^ mask]);
        }
    }

    void extract_graph(std::array<ll, hsz> &arr, ll l, ll r, ll tl, ll tr) {
        std::fill(ALL(arr), 0);
        std::size_t s = tr - tl;
        ll mask = (1ll << s) - 1;
        for (ll i = 0; i < r - l; i++) arr[1ll << i] = (bs_graph[i + l] >> tl) & mask;
    }

public:
    template <bool Dir>
    IndependentSet(const graph::Graph<Dir> &g) : gsz(g.size()), dp(2) {
        std::fill(ALL(bs_graph), 0);
        for (ll i = 0; i < gsz; i++) for (auto &&e : g[i]) {
            ll nxt = e.first;
            bs_graph[i] |= (1ll << nxt);
        }
    }

    ll solve() {
        ll left = 0, mid = gsz / 2, right = gsz;
        pii ranges[] = { { left, mid, }, { mid, right, } };

        for (ll i = 0; i < 2; i++) {
            ll l, r;
            std::tie(l, r) = ranges[i];

            std::size_t sz = r - l;
            dp[i].resize(1ll << sz);
            extract_graph(halfg, l, r, l, r);
            calc_sz(dp[i], halfg, sz, l);
        }

        extract_graph(halfg, left, mid, mid, right);
        build_neigh(halfg, mid - left);
        ll mask = 1ll << (right - mid);
        for (ll i = 0; i < (1ll << (mid - left)); i++) {
            ll &e = halfg[i];
            e = (~e) & (mask - 1);
        }

        ll ret = 0;
        for (ll i = 0; i < (1ll << (mid - left)); i++) {
            ll j = halfg[i];
            chmax(ret, dp[0][i] + dp[1][j]);
        }

        return ret;
    }
};

template <bool Dir>
ll indep_set(const Graph<Dir> &gr) {
    IndependentSet<40> iset(gr);
    return iset.solve();
}

}

bool solve() {
    ll n;
    std::cin >> n;
    if (!n) return false;

    std::map<std::string, ll> id_mp;
    auto get_id = [&](const std::string &s) {
        auto ite = id_mp.find(s);
        if (ite != id_mp.end()) return ite->second;
        ll tmp = id_mp.size();
        id_mp[s] = tmp;
        return tmp;
    };

    pows = vec<ll>(n);
    graph::Graph<true> g(n);
    for (ll i = 0; i < n; i++) {
        std::string a;
        ll b, c;
        std::cin >> a >> b >> c;
        ll id = get_id(a);
        pows[id] = b;
        while (c--) {
            std::string t;
            std::cin >> t;
            ll tid = get_id(t);
            g.add_edge(id, tid);
        }
    }

    for (auto &&e : g[0]) pows[e.first] = 0;
    std::cout << graph::indep_set(g) << '\n';
    return true;
}

int main() {
    while (solve());
    return 0;
}




Measured memory_bytes: 27632