The 22nd Japanese Olympiad in Informatics (JOI 2022/2023)

Spring Training/Qualifying Trial

March 18–22, 2023 (Komaba, Tokyo)

Contest 1 – Two Currencies

Two Currencies

There are N cities in JOI Kingdom, numbered from 1 to N. There are N − 1 roads in JOI Kingdom, numbered
from 1 to N − 1. The road i (1 ≤ i ≤ N − 1) connects the city Ai and the city Bi bi-directionally. It is possible to
travel from any city to any other city by passing through some of the roads.
There are checkpoints on some of the roads in JOI Kingdom. There are M checkpoints, numbered from 1 to
M. The checkpoint j (1 ≤ j ≤ M) is located on the road P j . In order to pass through it, you need to pay either
one gold coin or C j silver coins.
There are Q citizens in JOI Kingdom, numbered from 1 to Q. The citizen k (1 ≤ k ≤ Q) has Xk gold coins
and Yk silver coins, and wants to travel from the city S k to the city T k . Since gold coins are valuable, all the
citizens want to keep as many gold coins as possible.
Write a program which, given information of the cities, the roads, the checkpoints, and the citizens in JOI
Kingdom, for each k (1 ≤ k ≤ Q), determines whether it is possible for the citizen k to travel from the city S k to
the city T k , and, if it is possible, calculates the maximum possible number of gold coins the citizen k can keep.

Input
Read the following data from the standard input.

NMQ
A1 B1
A2 B2
..
.
AN−1 BN−1
P1 C1
P2 C2
..
.
PM C M
S 1 T 1 X1 Y1
S 2 T 2 X2 Y2
..
.
S Q T Q XQ YQ

Two Currencies– 1 / 7
 The 22nd Japanese Olympiad in Informatics (JOI 2022/2023)
Spring Training/Qualifying Trial
March 18–22, 2023 (Komaba, Tokyo)

Contest 1 – Two Currencies

Output
Write Q lines to the standard output. In the k-th line (1 ≤ k ≤ Q), if the citizen k can travel from the city S k
to the city T k , output the maximum possible number of gold coins the citizen k can keep. Otherwise, output -1
in the k-th line.

Constraints
• 2 ≤ N ≤ 100 000.
• 1 ≤ M ≤ 100 000.
• 1 ≤ Q ≤ 100 000.
• 1 ≤ Ai ≤ N (1 ≤ i ≤ N − 1).
• 1 ≤ Bi ≤ N (1 ≤ i ≤ N − 1).
• It is possible to travel from any city to any other city by passing through some of the roads.
• 1 ≤ P j ≤ N − 1 (1 ≤ j ≤ M).
• 1 ≤ C j ≤ 109 (1 ≤ j ≤ M).
• 1 ≤ S k ≤ N (1 ≤ k ≤ Q).
• 1 ≤ T k ≤ N (1 ≤ k ≤ Q).
• S k , T k (1 ≤ k ≤ Q).
• 0 ≤ Xk ≤ 109 (1 ≤ k ≤ Q).
• 0 ≤ Yk ≤ 1018 (1 ≤ k ≤ Q).
• Given values are all integers.

Subtasks
1. (10 points) N ≤ 2 000, M ≤ 2 000, Q ≤ 2 000.
2. (28 points) C1 = C2 = · · · = C M .
3. (30 points) Ai = i, Bi = i + 1 (1 ≤ i ≤ N − 1).
4. (32 points) No additional constraints.

Two Currencies– 2 / 7
 The 22nd Japanese Olympiad in Informatics (JOI 2022/2023)
Spring Training/Qualifying Trial
March 18–22, 2023 (Komaba, Tokyo)

Contest 1 – Two Currencies

Sample Input and Output

Sample Input 1 Sample Output 1
5 4 3 1
1 2 2
1 3 -1
2 4
2 5
2 9
2 4
3 5
4 7
3 4 2 11
5 3 4 5
2 3 1 1

The citizen 1 can travel from the city 3 to the city 4 as follows. After the travel, the citizen 1 keeps one gold
coin.

1. The citizen 1 travels from the city 3 to the city 1 by passing through the road 2. There are the checkpoints
1, 2 on the road 2. The citizen 1 pays one gold coin at the checkpoint 1 and passes through it, and 4 silver
coins at the checkpoint 2 and passes through it, respectively. After that, the citizen 1 keeps one gold coin
and 7 silver coins.
2. The citizen 1 travels from the city 1 to the city 2 by passing through the road 1. Since there is no
checkpoint on the road 1, the citizen 1 keeps one gold coin and 7 silver coins.
3. The citizen 1 travels from the city 2 to the city 4 by passing through the road 3. There is the checkpoint
3 on the road 3. The citizen 1 pays 5 silver coins at the checkpoint 3 and passes through it. After that,
the citizen 1 keeps one gold coin and 2 silver coins.

Since it is impossible for the citizen 1 to travel by finally keeping more than or equal to 2 gold coins, output
1 in the first line.
The citizen 2 can travel from the city 5 to the city 3 as follows. After the travel, the citizen 2 keeps two gold
coins.

1. The citizen 2 travels from the city 5 to the city 2 by passing through the road 4. There is the checkpoint
4 on the road 4. The citizen 2 pays one gold coin at the checkpoint 4 and passes through it. After that,

Two Currencies– 3 / 7
 The 22nd Japanese Olympiad in Informatics (JOI 2022/2023)
Spring Training/Qualifying Trial
March 18–22, 2023 (Komaba, Tokyo)

Contest 1 – Two Currencies

the citizen 2 keeps 3 gold coins and 5 silver coins.

2. The citizen 2 travels from the city 2 to the city 1 by passing through the road 1. Since there is no
checkpoint on the road 1, the citizen 2 keeps 3 gold coins and 5 silver coins.
3. The citizen 2 travels from the city 1 to the city 3 by passing through the road 2. On the road 2, there are
the checkpoints 1, 2. The citizen 2 pays one gold coin at the checkpoint 1 and passes through it, and 4
silver coins at the checkpoint 2 and passes through it, respectively. After that, the citizen 2 keeps 2 gold
coins and one silver coin.

Since it is impossible for the citizen 2 to travel by finally keeping more than or equal to 3 gold coins, output
2 in the second line.
Since it is impossible for the citizen 3 to travel from the city 2 to the city 3, output -1 in the third line.
This sample input satisfies the constraints of Subtasks 1, 4.

Two Currencies– 4 / 7
 The 22nd Japanese Olympiad in Informatics (JOI 2022/2023)
Spring Training/Qualifying Trial
March 18–22, 2023 (Komaba, Tokyo)

Contest 1 – Two Currencies

Sample Input 2 Sample Output 2

10 7 9 3
1 8 6
6 3 6
5 9 7
7 9 7
3 1 3
3 4 1
10 1 2
2 6 2
5 6
9 4
7 4
7 4
2 4
7 4
7 4
1 4
8 6 5 3
3 9 8 0
4 7 6 15
7 4 9 3
6 4 8 0
9 10 5 16
5 3 2 4
2 8 4 3
6 1 3 3

This sample input satisfies the constraints of Subtasks 1, 2, 4.

Two Currencies– 5 / 7
 The 22nd Japanese Olympiad in Informatics (JOI 2022/2023)
Spring Training/Qualifying Trial
March 18–22, 2023 (Komaba, Tokyo)

Contest 1 – Two Currencies

Sample Input 3 Sample Output 3

8 7 11 7
1 2 5
2 3 5
3 4 5
4 5 4
5 6 2
6 7 0
7 8 2
4 4 1
3 7 4
2 10 5
5 2
4 1
4 4
5 6
6 3 7 69
7 1 5 55
3 1 6 8
8 2 5 45
4 6 4 45
6 1 3 33
2 1 0 19
3 7 2 31
7 1 2 31
7 2 4 58
8 3 5 63

This sample input satisfies the constraints of Subtasks 1, 3, 4.

Two Currencies– 6 / 7
 The 22nd Japanese Olympiad in Informatics (JOI 2022/2023)
Spring Training/Qualifying Trial
March 18–22, 2023 (Komaba, Tokyo)

Contest 1 – Two Currencies

Sample Input 4 Sample Output 4

8 7 11 1
1 8 3
1 4 1
3 1 7
3 6 0
6 7 4
2 1 5
5 2 7
5 5 8
5 8 10
4 7 6
6 6
4 1
6 4
1 7
4 7 2 18
2 4 5 1
4 2 1 32
1 5 7 21
2 5 0 50
8 4 4 33
1 7 6 16
4 8 7 18
1 2 8 13
5 4 10 42
7 1 6 40

This sample input satisfies the constraints of Subtasks 1, 4.

Two Currencies– 7 / 7