#include <bits/stdc++.h>
const int N = 300;
const int inf = 1e9;
using namespace std;
int n, val[N + 5], id1[N + 5], id2[N + 5], S, T, idc;
long long ans;
namespace F {
const int N = 1e6;
const long long inf = 2e18;
struct edges {
  int to;
  long long cost;
} edge[N * 2 + 5];
int nxt[N * 2 + 5], head[N + 5], edge_cnt = 1, dis[N + 5], q[N + 5], cur[N + 5],
                                 S, T;
void add_edge(int u, int v, long long w) {
  edge[++edge_cnt] = (edges){v, w};
  nxt[edge_cnt] = head[u];
  head[u] = edge_cnt;
}
void add(int u, int v, long long w) {
  add_edge(u, v, w);
  add_edge(v, u, 0);
}
int bfs() {
  for (int i = 1; i <= idc; i++) cur[i] = head[i], dis[i] = 0;
  int l = 1, r = 0;
  dis[S] = 1;
  q[++r] = S;
  while (l <= r) {
    int u = q[l++];
    for (int i = head[u]; i; i = nxt[i]) {
      int v = edge[i].to, w = edge[i].cost;
      if (w && !dis[v]) {
        dis[v] = dis[u] + 1;
        q[++r] = v;
      }
    }
  }
  return dis[T];
}
long long dfs(int u, long long flow) {
  if (u == T) return flow;
  long long sm = 0;
  for (int &i = cur[u]; i; i = nxt[i]) {
    int v = edge[i].to;
    long long w = edge[i].cost;
    if (dis[v] == dis[u] + 1 && w) {
      long long res = dfs(v, min(w, flow));
      edge[i].cost -= res;
      edge[i ^ 1].cost += res;
      sm += res;
      flow -= res;
      if (!flow) break;
    }
  }
  return sm;
}
long long dinic(int s, int t) {
  S = s;
  T = t;
  long long ans = 0;
  while (bfs()) ans += dfs(S, inf);
  return ans;
}
void clear() {
  edge_cnt = 1;
  for (int i = 1; i <= idc; i++) head[i] = 0;
  idc = 0;
}
}  // namespace F
int main() {
  scanf("%d", &n);
  S = ++idc;
  T = ++idc;
  for (int i = 1; i <= n; i++) {
    id1[i] = ++idc;
    F::add(id1[i], T, inf);
  }
  int s, x;
  for (int i = 1; i <= n; i++) {
    id2[i] = ++idc;
    scanf("%d", &s);
    for (int j = 1; j <= s; j++) {
      scanf("%d", &x);
      F::add(id2[i], id1[x], inf);
    }
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &val[i]);
    F::add(S, id2[i], -val[i] + inf);
  }
  ans = F::dinic(S, T);
  while (ans >= inf / 2) ans -= inf;
  for (int i = 1; i <= n; i++) ans += val[i];
  cout << ans << endl;
  return 0;
}
