Problem: The Hexadecimal virus loves playing with number sets — intersecting them, uniting them. One beautiful day she was surprised to find out that Scuzzy, her spherical pet cat, united all sets in one and ate the result! Something had to be done quickly and Hexadecimal rushed to the market.

The market has n sets of numbers on sale. The virus wants to buy the following collection of sets: the number of sets in the collection should be exactly the same as the number of numbers in the union of all bought sets. Moreover, Hexadecimal wants to buy the cheapest suitable collection of set.

Yet nothing's so easy! As Mainframe is a kingdom of pure rivalry markets, we know that the union of any k sets contains no less than k distinct numbers (for every positive integer k).

Help the virus choose the suitable collection of sets. The collection can be empty.

Input

The first line contains the only number n (1 ≤ n ≤ 300) — the number of sets available in the market.

Next n lines describe the goods: first we are given mi (1 ≤ mi ≤ n) — the number of distinct numbers in the i-th set, then follow mi numbers — the set's elements. We know that the set's elements are distinct positive integers and they do not exceed n.

The last line contains n integers whose absolute values do not exceed 106 — the price of each set.

Output

Print a single number — the minimum price the virus will have to pay for such a collection of k sets that union of the collection's sets would have exactly k distinct numbers (<image>).

Examples

Input

3
1 1
2 2 3
1 3
10 20 -3


Output

-3


Input

5
2 1 2
2 2 3
2 3 4
2 4 5
2 5 1
1 -1 1 -1 1


Output

0


Input

5
2 1 2
2 2 3
2 3 4
2 4 5
2 5 1
-1 1 -1 1 -1


Output

-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int N = 300;
const int inf = (int)1e9;
inline int min(int x, int y) {
  if (x < y) return x;
  return y;
}
struct NetWork {
  static const int V = N + 2;
  static const int E = N * N + N;
  struct Edge {
    int to, cap, nxt;
    Edge() {}
    Edge(int _to, int _cap, int _nxt) : to(_to), cap(_cap), nxt(_nxt) {}
  } edge[E * 2 + 5];
  int Gsz, head[V + 5];
  inline void add_edge(int u, int v, int cap) {
    edge[Gsz] = Edge(v, cap, head[u]);
    head[u] = Gsz++;
    edge[Gsz] = Edge(u, 0, head[v]);
    head[v] = Gsz++;
  }
  int src, dest, n;
  void init(int _n) {
    n = _n;
    src = n++;
    dest = n++;
    for (int i = 0, i_END_ = n; i < i_END_; ++i) head[i] = -1;
    Gsz = 0;
  }
  int dist[V + 5], que[V + 5];
  bool bfs() {
    for (int i = 0, i_END_ = n; i < i_END_; ++i) dist[i] = -1;
    int L = 0, H = 0;
    que[H++] = src;
    dist[src] = 0;
    while (L < H) {
      int u = que[L++];
      for (int i = head[u]; ~i; i = edge[i].nxt) {
        int v = edge[i].to;
        if (edge[i].cap > 0 && dist[v] == -1) {
          dist[v] = dist[u] + 1;
          que[H++] = v;
        }
      }
    }
    return dist[dest] != -1;
  }
  int work[V + 5];
  int dfs(int u, int aug) {
    if (u == dest || aug == 0) return aug;
    int res = 0;
    for (int &i = work[u]; ~i; i = edge[i].nxt) {
      int v = edge[i].to;
      if (edge[i].cap > 0 && dist[v] == dist[u] + 1) {
        int tmp = dfs(v, min(edge[i].cap, aug));
        edge[i].cap -= tmp;
        edge[i ^ 1].cap += tmp;
        res += tmp;
        aug -= tmp;
        if (aug == 0) break;
      }
    }
    return res;
  }
  int Dinic() {
    int res = 0;
    while (bfs()) {
      for (int i = 0, i_END_ = n; i < i_END_; ++i) work[i] = head[i];
      res += dfs(src, (int)1e9);
    }
    return res;
  }
} nw;
int cost[N + 5];
struct Bipartite_Graph {
  static const int V = N + N;
  bool g[V + 5][V + 5];
  int n;
  void init(int _n) {
    n = _n;
    for (int i = 0, i_END_ = n; i < i_END_; ++i)
      for (int j = 0, j_END_ = n; j < j_END_; ++j) g[i][j] = false;
  }
  int match[V + 5];
  bool visy[V + 5];
  bool find(int x) {
    for (int y = 0, y_END_ = n; y < y_END_; ++y)
      if (g[x][y]) {
        if (visy[y]) continue;
        visy[y] = true;
        if (match[y] == -1 || find(match[y])) {
          match[y] = x;
          return true;
        }
      }
    return false;
  }
  void Hungary() {
    for (int y = 0, y_END_ = n; y < y_END_; ++y) match[y] = -1;
    for (int x = 0, x_END_ = n; x < x_END_; ++x) {
      for (int y = 0, y_END_ = n; y < y_END_; ++y) visy[y] = false;
      assert(find(x));
    }
  }
  void build() {
    nw.init(n);
    for (int y = 0, y_END_ = n; y < y_END_; ++y) {
      int x = match[y];
      if (cost[x] > 0)
        nw.add_edge(nw.src, y, cost[x]);
      else
        nw.add_edge(y, nw.dest, -cost[x]);
      for (int i = 0, i_END_ = n; i < i_END_; ++i)
        if (g[x][i] && i != y) nw.add_edge(y, i, inf);
    }
  }
} bpt;
int n, sum;
void input() {
  scanf("%d", &n);
  bpt.init(n);
  for (int i = 0, i_END_ = n; i < i_END_; ++i) {
    int m;
    scanf("%d", &m);
    for (int j = 0, j_END_ = m; j < j_END_; ++j) {
      int x;
      scanf("%d", &x);
      --x;
      bpt.g[i][x] = true;
    }
  }
  sum = 0;
  for (int i = 0, i_END_ = n; i < i_END_; ++i) {
    scanf("%d", &cost[i]);
    cost[i] = -cost[i];
    if (cost[i] > 0) sum += cost[i];
  }
}
int main() {
  input();
  bpt.Hungary();
  bpt.build();
  printf("%d\n", -(sum - nw.Dinic()));
  return 0;
}