A connected road network has $5$ intersections (vertices). Exactly $2$ of the intersections have an odd number of roads meeting them (odd degree). Which statement about Eulerian paths in this network is correct?