#include <stdio.h>
#include <stdlib.h>

#define MAX_N 100010


int credits[MAX_N];
int dp[MAX_N][2];
int visited[MAX_N];

typedef struct Node {
    int val;
    struct Node* next;
} Node;

Node* adj[MAX_N];

void addEdge(int u, int v) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->val = v;
    newNode->next = adj[u];
    adj[u] = newNode;
}

void dfs(int u) {
    visited[u] = 1;
    dp[u][0] = 0;
    dp[u][1] = credits[u];

    Node* curr = adj[u];
    while (curr != NULL) {
        int v = curr->val;
        if (!visited[v]) {
            dfs(v);
            dp[u][0] += (dp[v][0] > dp[v][1] ? dp[v][0] : dp[v][1]);
            dp[u][1] += dp[v][0];
        }
        curr = curr->next;
    }
}

int main() {
    int n;
    scanf("%d", &n);

    for (int i = 0; i < n; i++) {
        scanf("%d", &credits[i]);
    }

    for (int i = 0; i < n; i++) {
        int a;
        scanf("%d", &a);
        for (int j = 0; j < a; j++) {
            int b;
            scanf("%d", &b);
            addEdge(i, b - 1);
        }
    }

    for (int i = 0; i < n; i++) {
        if (!visited[i]) {
            dfs(i);
        }
    }

    int max_credits = 0;
    for (int i = 0; i < n; i++) {
        int current_max = (dp[i][0] > dp[i][1]) ? dp[i][0] : dp[i][1];
        if (current_max > max_credits) {
            max_credits = current_max;
        }
    }

    printf("%d\n", max_credits);

    for (int i = 0; i < n; i++) {
        Node* curr = adj[i];
        while (curr != NULL) {
            Node* temp = curr;
            curr = curr->next;
            free(temp);
        }
    }

    return 0;
}