We provide a hierarchy of tree languages recognised by nondeterministic parity tree automata with priorities in {0,1,2} , whose length exceeds the first fixed point of the ε operation (that itself enumerates the fixed points of x↦ω^x ). We conjecture that, up to Wadge equivalence, it exhibits all regular tree languages of index [0,2] .