However, when y is not the root of a component, and z is the root of the component containing y, then the tree we obtain from the reading off process is one where x dominates z and not where z properly dominates x.
in this case, we replace the d-edge between x and y with a d-edge between x and z, which we then eliminate in the reading off process by equating x and z.