Edge weights and vertex colours

Can the edges of any non-trivial graph be assigned weights from {1,2,3} so that adjacent vertices have different sums of incident edge weights? e a positive answer when the graph is 3-colourable, or when a finite number of real weights is allowed.