the length of the shortest path from a to b that visits all vertices is the same as the shortest path from a to b that does not visit the clause vertices plus m because we have to pay one extra edge for each clause vertex that we visit here.