  We show that for every graph without isolated edge, the edges can be assigned
weights from {1,2,3} so that no two neighbors receive the same sum of incident
edge weights. This solves a conjecture of Karo\'{n}ski, Luczak, and Thomason
from 2004.
