A new trade empire is rising in Berland. Bulmart, an emerging trade giant, decided to dominate the market of ... shovels! And now almost every city in Berland has a Bulmart store, and some cities even have several of them! The only problem is, at the moment sales are ... let's say a little below estimates. Some people even say that shovels retail market is too small for such a big company to make a profit. But the company management believes in the future of that market and seeks new ways to increase income.
There are n cities in Berland connected with m bi-directional roads. All roads have equal lengths. It can happen that it is impossible to reach a city from another city using only roads. There is no road which connects a city to itself. Any pair of cities can be connected by at most one road.
There are w Bulmart stores in Berland. Each of them is described by three numbers:
The latest idea of the Bulmart management is to create a program which will help customers get shovels as fast as possible for affordable budget. Formally, the program has to find the minimum amount of time needed to deliver r_{j} shovels to the customer in the city g_{j} for the total cost of no more than a_{j} burles. The delivery time between any two adjacent cities is equal to 1. If shovels are delivered from several cities, the delivery time is equal to the arrival time of the last package. The delivery itself is free of charge.
The program needs to find answers to q such queries. Each query has to be processed independently from others, i.e. a query does not change number of shovels in stores for the next queries.
The first line contains two integers n, m (1 ≤ n ≤ 5000, 0 ≤ m ≤ min(5000, n·(n - 1) / 2)). Each of the next m lines contains two integers x_{e} and y_{e}, meaning that the e-th road connects cities x_{e} and y_{e} (1 ≤ x_{e}, y_{e} ≤ n).
The next line contains a single integer w (1 ≤ w ≤ 5000) — the total number of Bulmart stores in Berland. Each of the next w lines contains three integers describing the i-th store: c_{i}, k_{i}, p_{i} (1 ≤ c_{i} ≤ n, 1 ≤ k_{i}, p_{i} ≤ 2·10^{5}).
The next line contains a single integer q (1 ≤ q ≤ 1000) — the number of queries. Each of the next q lines contains three integers describing the j-th query: g_{j}, r_{j} and a_{j} (1 ≤ g_{j} ≤ n, 1 ≤ r_{j}, a_{j} ≤ 10^{9})
Output q lines. On the j-th line, print an answer for the j-th query — the minimum amount of time needed to deliver r_{j} shovels to the customer in city g_{j} spending no more than a_{j} burles. Print -1 if there is no solution for the j-th query.
6 4
4 2
5 4
1 2
3 2
2
4 1 2
3 2 3
6
1 2 6
2 3 7
3 1 2
4 3 8
5 2 5
6 1 10
2
-1
2
2
3
-1
Name |
---|