A bug starts at one vertex of a cube and moves along the edges of the cube according to the following rule. At each vertex, the bug will choose to travel along one of the three edges emanating from that vertex. Each edge has equal probability of being chosen, and all choices are independent. What is the probability that after seven moves the bug will have visited every vertex exactly once? The original answer is in \(\frac{k}{m}\) format, please give the value of k + m.

Let's think step by step and output the final answer within \boxed{}.
user