# Copyright (c) 2023 kamyu. All rights reserved.
#
# Meta Hacker Cup 2023 Round 2 - Problem C. Wiki Race
# https://www.facebook.com/codingcompetitions/hacker-cup/2023/round-2/problems/C
#
# Time:  O(N + SUM_LEN_S), SUM_LEN_S = sum(len(x) for i in range(N) for x in S[i])
# Space: O(N + SUM_LEN_S)
#

from collections import Counter

def wiki_race():
    def iter_dfs():
        stk = [0]
        while stk:
            u = stk.pop()
            while len(adj[u]) == 1:
                v = adj[u][0]
                for x in S[v]:
                    S[u].add(x)
                adj[u] = adj[v]
            for v in adj[u]:
                stk.append(v)

    def iter_dfs2():
        lookup = set()
        ret = Counter()
        stk = [(1, (0, ret))]
        while stk:
            step, args = stk.pop()
            if step == 1:
                u, ret = args
                cnt = Counter()
                stk.append((4, (u, cnt, ret)))
                stk.append((2, (u, 0, cnt)))
            elif step == 2:
                u, i, cnt = args
                if i == len(adj[u]):
                    continue
                ret = Counter()
                stk.append((2, (u, i+1, cnt)))
                stk.append((3, (ret, cnt)))
                stk.append((1, (adj[u][i], ret)))
            elif step == 3:
                ret, cnt = args
                for k, v in ret.items():
                    cnt[k] += v
            elif step == 4:
                u, cnt, ret = args
                if not adj[u]:
                    for x in S[u]:
                        if x not in lookup:
                            ret[x] = 1
                    continue
                for x in S[u]:
                    if x not in lookup:
                        cnt[x] += 1
                for k, v in cnt.items():
                    if k in lookup:
                        continue
                    v -= int(k in S[u])
                    if v == len(adj[u]):
                        ret[k] = 1
                    elif v+1 == len(adj[u]):
                        ret[k] = int(k in S[u])
                    else:
                        lookup.add(k)
        return sum(ret.values())

    N = int(input())
    P = list(map(lambda x: int(x)-1, input().split()))
    S = [set(input().split()[1:]) for _ in range(N)]
    lookup = {}
    for i in range(N):
        for x in S[i]:
            if x not in lookup:
                lookup[x] = len(lookup)
        S[i] = {lookup[x] for x in S[i]}
    adj = [[] for _ in range(N)]
    for i, p in enumerate(P, 1):
        adj[p].append(i)
    iter_dfs()
    return iter_dfs2()

for case in range(int(input())):
    print('Case #%d: %s' % (case+1, wiki_race()))