How to find the shortest path between nodes in a complete graph while the path has to contain specific nodes

Question

I have given two nodes in a complete undirected graph containing around 60 to 80 nodes connected by weighted edges. Every node is assigned a whole number between 0 and 2 (0,