Deciding the Borel complexity of regular tree languages

We show that it is decidable whether a given a regular tree language belongs to the class ${\mathbf{\Delta }}_{\mathbf{2}}^{\mathbf{0}}$ of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable.