Hint 1
Use the Memo function to trace out potential courses the mole could follow.
On the edge of a forest lives a particularly messy mole. His burrow is so clogged with trash that eventually he has to tidy up. However, being lazy, he decides to clean his place while doing the least work possible.
In order to pick up all the trash in his burrow without passing through any one tunnel twice, which of the holes, A through G, should the mole start cleaning from? While moving through any tunnel twice is forbidden, he can pass through any junction between tunnels as often as he wants.

Use the Memo function to trace out potential courses the mole could follow.
Do you see the little T intersection just above hole F? That's where the mole will end up when he's picked up the very last piece of trash. Find a course that lets him conclude his cleaning at that location.
Search for a hole that leads to an odd number of separate routes.
Good job!
Our friend the lazy mole should start his cleaning from hole C. Starting his cleanup effort from any other hole will cause him to run through at least one tunnel twice before the job is finished.

Hints you open and puzzles you mark solved are kept in this browser.