graph patfinding algorithm for path that must pass through certain node?

Question

I have a problem, where I have a non-directed, non weighted graph, with a starting node s, a sink node t, and a special node w.

Now, I need to find a simple p