We study achievability and converse bounds for message-wise unequal error protection (UEP) codebooks with $m>1$ different classes of codewords. We dub these UEP codes ``assorted codes". We extend the dependence testing and the meta-converse bounds due to Polyanskiy-Poor-Verd'u to be applicable to assorted codes and use this extension to obtain refined asymptotic expansions for the performance of such codes over discrete memoryless channels. Our achievability bound is further evaluated for binary symmetric and binary erasure channels, and we show that our bounds are superior to the ``header'' construction that first encodes the message class. Applications of assorted codes to joint source-channel coding is briefly addressed.