 So now we have an infinite graph every vertex of which has degree 4. Unlike the tree for the free monoid on 2 generators, where the root is topologically different from the other vertices, the tree for the free group on 2 generators is entirely homogeneous. Thus if we throw away the vertex labels and rely only on the edge labels to navigate, any vertex can be taken as the identity of the group.