Labeling half of a bipartite graph
Your problem is known as hypergraph 2-colorability; the hypergraph has $U$ as vertices and the neighborhoods of vertices of $V$ as edges. Determining whether a hypergraph is 2-colorable is NP-complete.