Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Roads in Yusland

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputMayor of Yusland just won the lottery and decided to spent money on something good for town. For example, repair all the roads in the town.

Yusland consists of *n* intersections connected by *n* - 1 bidirectional roads. One can travel from any intersection to any other intersection using only these roads.

There is only one road repairing company in town, named "RC company". Company's center is located at the intersection 1. RC company doesn't repair roads you tell them. Instead, they have workers at some intersections, who can repair only some specific paths. The *i*-th worker can be paid *c*_{i} coins and then he repairs all roads on a path from *u*_{i} to some *v*_{i} that lies on the path from *u*_{i} to intersection 1.

Mayor asks you to choose the cheapest way to hire some subset of workers in order to repair all the roads in Yusland. It's allowed that some roads will be repaired more than once.

If it's impossible to repair all roads print - 1.

Input

The first line of the input contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 300 000) — the number of cities in Yusland and the number of workers respectively.

Then follow *n*−1 line, each of them contains two integers *x*_{i} and *y*_{i} (1 ≤ *x*_{i}, *y*_{i} ≤ *n*) — indices of intersections connected by the *i*-th road.

Last *m* lines provide the description of workers, each line containing three integers *u*_{i}, *v*_{i} and *c*_{i} (1 ≤ *u*_{i}, *v*_{i} ≤ *n*, 1 ≤ *c*_{i} ≤ 10^{9}). This means that the *i*-th worker can repair all roads on the path from *v*_{i} to *u*_{i} for *c*_{i} coins. It's guaranteed that *v*_{i} lies on the path from *u*_{i} to 1. Note that *v*_{i} and *u*_{i} may coincide.

Output

If it's impossible to repair all roads then print - 1. Otherwise print a single integer — minimum cost required to repair all roads using "RC company" workers.

Example

Input

6 5

1 2

1 3

3 4

4 5

4 6

2 1 2

3 1 4

4 1 3

5 3 1

6 3 2

Output

8

Note

In the first sample, we should choose workers with indices 1, 3, 4 and 5, some roads will be repaired more than once but it is OK. The cost will be equal to 2 + 3 + 1 + 2 = 8 coins.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/23/2019 22:08:28 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|