Dijkstra's Time complexity

I am confused int the time complexity of Prim’ O(V+ElogV), why there is a logV instead of logE . For a node we check all it’s edges and the edges that are relaxed are pushed into priority queue so there may be more than one entry in queue for a node with different cost, so number of element in heap will be more than V