A Vizing-like theorem for union vertex-distinguishing edge coloring

We show that for any graph (without connected component reduced to an edge or a single vertex), the minimum number of colors for which such a coloring exists can only take 3 possible values depending on the order of the graph. Moreover, we provide the exact value for paths, cycles and complete binary trees.