We characterize trees as median algebras and semilattices by relaxing conservativeness. Moreover, we describe median homomorphisms between products of median algebras and show that Arrow type impossibility theorems for mappings from a product A 1 x...x An of median algebras to a median algebra B are possible if and only if B is a tree, when thought of as an ordered structure.