### minTime 
from collections import defaultdict
from typing import *
def f_gold(n: int, edges: List[List[int]], hasApple: List[bool]) -> int:
    def dfs(u, cost):
        if vis[u]:
            return 0
        vis[u] = True
        nxt_cost = 0
        for v in g[u]:
            nxt_cost += dfs(v, 2)
        if not hasApple[u] and nxt_cost == 0:
            return 0
        return cost + nxt_cost
    g = defaultdict(list)
    for u, v in edges:
        g[u].append(v)
        g[v].append(u)
    vis = [False] * n
    return dfs(0, 0)