Problem 21D - Traveling Graph

How would we solve the problem if it was compulsory to visit some given edges at least once and optional to visit others ???

Any approach / solution / code is much appreciated.

Thanks a lot :)