Preferred most-parsimonious tree (see Fig. 5) showing distribution of characters (upper numbers) and states (lower numbers) optimized as in Appendix 2. Asterisks (*) indicate character states unambiguously placed (position not changing under any optimization). Solid hashmarks indicate unique state changes, and open hashmarks are homoplasies. Letters within boxes indicate breaks in branches to enable effective layout. [continued over 5 pages]