The 1-2-3 Conjecture asks whether almost all graphs can be (edge-)labelled with 1, 2, 3 so that no two adjacent vertices are incident to the same sum of labels. In last decades, several aspects this problem have been studied in literature, including more general versions and slight variations. Notable such variations include List variant, which edges must assigned labels from dedicated lists th...