Count Shortest Paths

Given an undirected weighted graph, print the number of distinct shortest paths from node 1 to node n, modulo 1,000,000,007.

2 <= n <= 10^5