Markov Chains & Long-Run Behavior · Superchallenge problem

An ant walks on the vertices of a cube, moving each step along one of the three edges at its vertex, chosen uniformly. It starts at vertex $H$. What is the probability that it returns to $H$ before it ever visits the vertex diagonally opposite $H$? Express your answer as a common fraction.