The empty word is the unique vertex of degree three in the underlying tree; every other vertex has degree four. Every graph automorphism therefore fixes the empty word and permutes its three neighbours. Those neighbours are precisely {0,1,2}, so this set is invariant.