We determine the Borel complexity of the topological isomorphism problem for profinite, t.d.l.c., and Roelcke precompact non-Archimedean groups, by showing it is equivalent to graph isomorphism.

For oligomorphic groups we merely establish this as an upper bound.

Joint work with Kechris and Tent.