Given an acyclic graph of a city where each edge represents a road and each vertex represents an intersection, write an algorithm to find the minimum number of vertices at which police officers should be stationed so that all the roads are covered. If a police officer is stationed at a vertex, then all the edges connected to that vertex are considered covered.