I'd appreciate any pointer for the following problem.

Given a DAG G=(V,E), each edge has assigned a color from a set of colors C. Different edges may have assigned the same color. There is a special start node s and end node t. Given K, we would like to find a s-t shortest path on G that traverses exactly K distinct colors, if any.