First, we note that no node in this graph has in-degree greater than 1.
each node except for the dummy root has exactly one head, either explicit or (if no head has been assigned in A or in the gold tree) the dummy root.