We explore Boolean-valued models of set theory with a class of urelements. In an existing construction, which we call UB, every urelement is its own B-name. We prove the fundamental theorem of UB in the context of ZFUR (i.e., ZF with urelements formulated with Replacement). In particular, UB is shown to preserve Replacement and hence ZFUR. Moreover, UB can both destroy axioms, such as the DCω1-scheme, and recover axioms, such as the Collection Principle. One drawback of UB is that it (...) does not permit mixing names, resulting in a lack of fullness. To address this, we introduce a new construction, UB‾, which is closed under mixtures. We prove that there is an elementary embedding from UB to UB‾. Over ZFUR with the Axiom of Choice, UB‾ is full for every complete Boolean algebra B just in case the Collection Principle holds. (shrink)