Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T, there is a set of four characters that define T. Here we deal with the general case, where T is an arbitrary X-tree. We show that if d is the maximum degree of any vertex in T, then the minimum number of characters that identify T is log₂d (up to a small multiplicative constant).