Let be a connected graph with edges. Prove that it is possible to label the edges of with the numbers in such a way that for every vertex incident to two or more edges, the greatest common divisor of the labels of the edges incident to that vertex is 1.