Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs