#include <bits/stdc++.h>
using namespace std;
using pii = pair<int64_t, int>;
constexpr int N = 2e5 + 10;
vector<int> adj[N];
__int128_t dis[N], sum[N];
map<int, int> sp[N];
map<int, int64_t> mp[N];
signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int n;cin >> n;
    for (int i = 1;i <= n;i ++ ) {
        int s, k, r;
        cin >> s >> k >> r;
        dis[i] = k, sum[i] = s;
        
        while (r -- ) {
            int a;cin >> a;
            adj[a].push_back(i);
        }
    }

    for (int i = 1;i <= n;i ++ ) {
        for (auto x : adj[i]) {
            mp[x][i] += dis[i], sum[x] += dis[i], sp[x][i] ++;
        }
        sort(adj[i].begin(), adj[i].end());
        adj[i].erase(unique(adj[i].begin(), adj[i].end()), adj[i].end());
    }

    vector<bool> vis(n + 1);
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    for (int i = 1;i <= n;i ++ ) {
        pq.push({dis[i], i});
    }
    while (pq.size()) {
        auto [d, u] = pq.top();pq.pop();
        if (vis[u]) continue;
        vis[u] = true;
        for (auto x : adj[u]) {
            if (dis[x] > sum[x] - mp[x][u] + dis[u] * sp[x][u]) {
                dis[x] = sum[x] - mp[x][u] + dis[u] * sp[x][u];
                mp[x][u] = dis[u] * sp[x][u];
                pq.push({dis[x], x});
            }
        }
    }
    cout << (int64_t)dis[1] << '\n';
}