Maximum Strategic Savings

문제

A long time ago in a galaxy far, far away, there are N planets numbered from 1 to N. Each planet has M cities numbered from 1 to M. Let city f of planet e be denoted as (e, f).

There are N × P two-way flights in the galaxy. For every planet e (1 ≤ e ≤ N), there are P flights numbered from 1 to P. Flight i connects cities (e, a_i) and (e, b_i) and costs ci energy daily to maintain.

There are M × Q two-way portals in the galaxy. For all cities with number f (1 ≤ f ≤ M), there are Q portals numbered from 1 to Q. Portal j connects cities (x_j, f) and (y_j, f) and costs z_j energy daily to maintain.

It is possible to travel between any two cities in the galaxy using only flights and/or portals.

Hard times have fallen on the galaxy. It was decided that some flights and/or portals should be shut down to save as much energy as possible, but it should remain possible to travel between any two cities afterwards.

What is the maximum sum of energy that can be saved daily?

입력

The first line contains four space-separated integers N, M, P, Q (1 ≤ N, M, P, Q ≤ 10⁵).

Then P lines follow; the i-th one contains three space-separated integers a_i, b_i, c_i (1 ≤ a_i, b_i ≤ M, 1 ≤ c_i ≤ 10⁸).

Then Q lines follow; the j-th one contains three space-separated integers x_j, y_j, z_j (1 ≤ x_j, y_j ≤ N, 1 ≤ z_j ≤ 10⁸).

It is guaranteed that it will be possible to travel between any two cities using flights and/or portals. There may be multiple flights/portals between the same pair of cities or a flight/portal between a city and itself.

출력

Output a single integer, the maximum sum of energy that can be saved daily.

2 2 1 2
1 2 1
2 1 1
2 1 1

3

2 3 4 1
2 3 5
3 2 7
1 2 6
1 1 8
2 1 5

41