This is a puzzle from the Expert section of my game Fetching Alchemist, visually modified for presentation here. It is a variant of the Travelling Salesman problem where you are trying to complete a set of quests.
The red numbers indicate the distance of each road. You need to find the shortest path that allows you to complete all the quests. Present your answer in the form "ABCDE", where the letters are the places you visit on the path.
Shortest path distance for this puzzle:
You complete a quest simply by travelling there with the required items in your inventory, which are consumed upon completing the quest (if the quest has required items, indicated by the presence of items left of an arrow under the quest).
The items drawn around places are the reward items for the quests that can be completed there.
You can complete a quest more than once but only once per place.
You can complete more than one quest in the same place. When completing more than one quest in the same place, quests are completed automatically from top to bottom, and you cannot avoid completing quests. Consequently, completing a higher quest may prevent completing a lower quest.
If you would obtain an item from completing a quest, you can use it to complete a quest in the same place without travelling again.
You always start where the character is. You cannot return to the starting place once you have left. This is because, in the game, returning to the start is how you reset the puzzle.
If you are still unsure how to play, have a look at the first solved puzzle.