Shortest Routes II

There are n cities and m roads between them. Your task is to process q queries where you have to determine the length of the shortest route between two given cities. Input The first input line has three integers n, m and q: the number of cities, roads, and queries. Then, there are m lines describing the roads. Each line has three integers a, b and c: there is a road between cities a and b whose