In a directed graph with marked sources and targets, an edge $(a, b)$ is forced when it is the only edge leaving $a$. An instance is a yes-instance of REACHd when some marked target is reachable from some marked source by a possibly empty path of forced edges; no promise is made on the instance, whose vertices may have any outdegree. REACHd is the decision problem of the structures isomorphic to such an instance, and UNREACHd is its complement.