Confused in calculating the shortest-path using Dijkstra's Algorithm
Assuming that you only want to know the distance from A to a certain point, your first calculations are right. 
However A to H should be 37. Check that again.
Also, there are shorter paths from A to I and A to J. Just have a look again - the other values are correct.