A new type of edge-derived vertex coloring

We study the minimum number of weights assigned to the edges of a graph GG with no component K2K2 so that any two adjacent vertices have distinct sets of weights on their incident edges. The best possible upper bound on this parameter is proved.