Summary: Let \(c\) be a proper edge coloring of a graph \(G=(V,E)\) with integers \(1,2,\ldots,k\). Then \(k\geq \Delta(G)\), while Vizing’s theorem guarantees that we can take \(k\leq \Delta(G)+1\). On the course of investigating irregularities in graphs, it has been conjectured that with only slightly larger \(k\), that is, \(k=\Delta (G)+2\), we could enforce an additional strong feature of \(c\), namely that it attributes distinct sums of incident colors to adjacent vertices in \(G\) if only this graph has no isolated edges and is not isomorphic to \(C_5\). We prove the conjecture is valid for planar graphs of sufficiently large maximum degree. In fact an even stronger statement holds, as the necessary number of colors stemming from the result of Vizing is proved to be sufficient for this family of graphs. Specifically, our main result states that every planar graph \(G\) of maximum degree at least \(28\), which contains no isolated edges admits a proper edge coloring \(c:E\to \{1,2,\ldots ,\Delta(G)+1\}\) such that \(\sum_{e\ni u}c(e)\neq \sum_{e\ni v}c(e)\) for every edge \(uv\) of \(G\).