We prove that the product version of the 1-2-3 Conjecture, raised by Skowronek-Kazi{\'o}w in 2012, is true. Namely, for every connected graph with order at least 3, we prove that we can assign labels 1,2,3 to the edges in such a way that no two adjacent vertices are incident to the same product of labels.

翻译：我们证明2012年Skowronek-Kazi {}w 提出的1-2-3预测产品版本是真实的。 也就是说,对于每个至少3个有顺序的链接图表,我们证明我们可以将1,2,3的标签分到边缘,这样标签产品就不会发生两个相邻的脊椎事故。