1 #include <queue>
 2 #include <cstdio>
 3 #include <cctype>
 4 #include <cstring>
 5 #include <iostream>
 6 #include <algorithm>
 7 using namespace std;
 8
 9 const int maxn = 1500 + 10;
10 int n, m, head[maxn], val[maxn], dp[maxn][2][2], edge_num;
11
12 struct Edge { int v, nxt; } edge[maxn << 1];
13
14 inline int read() {
15   register char ch = 0; register int w = 0, x = 0;
16   while( !isdigit(ch) ) w |= (ch == '-'), ch = getchar();
17   while( isdigit(ch) ) x = (x * 10) + (ch ^ 48), ch = getchar();
18   return w ? -x : x;
19 }
20
21 inline void Add_edge(int u, int v) {
22   edge[++edge_num].v = v;
23   edge[edge_num].nxt = head[u], head[u] = edge_num;
24 }
25
26 inline void Deep_fs(int x, int p) {
27   int flag = 0, tmp = 1e8;
28   for(int i = head[x]; i; i = edge[i].nxt) {
29     if( edge[i].v == p ) continue;
30     Deep_fs(edge[i].v, x);
31     if( dp[edge[i].v][0][0] >= dp[edge[i].v][0][1] ) flag = 1;
32     dp[x][0][0] = dp[x][0][0] + min(dp[edge[i].v][0][0], dp[edge[i].v][0][1]);
33     dp[x][0][1] = dp[x][0][1] + min(dp[edge[i].v][1][0], dp[edge[i].v][1][1]);
34     dp[x][1][0] = dp[x][1][0] + min(dp[edge[i].v][0][0], dp[edge[i].v][0][1]);
35     dp[x][1][1] = dp[x][1][1] + min(dp[edge[i].v][1][0], dp[edge[i].v][1][1]);
36   }
37   if( !flag ) for(int i = head[x]; i; i = edge[i].nxt) {
38     if( edge[i].v == p ) continue;
39     tmp = min(tmp, dp[x][0][0] - dp[edge[i].v][0][0] + dp[edge[i].v][0][1]);
40   }
41   if( !flag ) dp[x][0][0] = tmp;
42   dp[x][0][1] = dp[x][0][1] + val[x], dp[x][1][1] = dp[x][1][1] + val[x];
43 }
44
45 int main(int argc, const char *argv[])
46 {
47   freopen("..\\nanjolno.in", "r", stdin);
48   freopen("..\\nanjolno.out", "w", stdout);
49
50   scanf("%d", &n);
51   for(int u, v, k, i = 1; i <= n; ++i) {
52     u = read(), val[u] = read(), k = read();
53     for(int j = 1; j <= k; ++j) v = read(), Add_edge(u, v), Add_edge(v, u);
54   }
55   Deep_fs(1, 0), printf("%d\n", min(dp[1][0][0], dp[1][0][1]));
56
57   fclose(stdin), fclose(stdout);
58   return 0;
59 }