Minimum time to finish target courses in a prerequisite DAG

Courses form a directed acyclic graph of prerequisites and each course takes a given time; any number of courses can run at once as soon as their prerequisites are done. Return the earliest time at which a given set of target courses is finished. Only the targets and what they depend on matter.