Undirected graph, minimum path

We have an undirected graph and every edge has a cost. We need to find the route from node A to node B with a minimum cost using Dijktra's algorithm and a priority queue. Some hints there please