Graph Coloring · Challenge problem

The cube graph $Q_3$ has the $8$ vertices $\{0,1\}^3$, with an edge between two vertices exactly when they differ in one coordinate ($12$ edges). If each vertex is independently painted one of $3$ colors uniformly at random, what is the probability that the result is a proper coloring (every edge joins two different colors), as a reduced fraction?