The query language which exactly matches the expressive power of regular tree grammars is MSO.
a set of trees is definable by a regular tree grammar iff there is an MSO formula that defines this set of trees (Gécseg and Steinby, 1997).