A group divisible design GDD(v, g, k, λ1, λ2) is a collection of ksubsets (called blocks) of a vsetof symbols where: the vset is divided into g groups; each pair of symbols from the same group occurs in exactly λ1 blocks; and each pair symbols from different groups occurs in exactly λ2 blocks. Pairs of symbols occurring in the same group are known to statisticians as firstassociates, and pairs occurring in different groups are called second associates. The existence of such GDDs has been of interest over the years, going back to at least the work of Bose and Shimamoto in 1952 who began classifying such designs. Recently, such an existence problem when g = 2 was solved in the case where the groups have the same size and the blocks have size 3. In this paper, we continue to focus on blocks of size 3, solving the problem when the required designs having twogroups of unequal sizes and λ1 λ2 = 1 and prove that the conditions are sufficient.