# Problem C

Chicken Joggers

In the woods of Lill-Jansskogen, there is a network of
trails that are often used by joggers. The trails have been
much appreciated, and have been specially selected by the
professors of the Royal Institute of Technology, enabling
university students to take a short break from their studies
and refresh their smart minds. Strangely enough, the network of
trails actually form a tree. When the trails were selected, the
professors of the university took the set of trails that they
found in Lill-Jansskogen and created a minimum spanning tree,
in order to “*encourage and inspire computer science
students to participate in physical activities by applying
graph theory in the beautiful surroundings of the Royal
Institute of Technology*”.

Unfortunately, the computer science students are not that brave. Winter is approaching, and it is getting darker and darker in the city of Stockholm. Recently, a bunch of programmers from CSC (Community of Scared Cowards) have been complaining that it is too dark in parts of the trail network at night. Some of the trails are lit up by lamps, but sometimes that is not enough for the CSC. They would like to see that all the trails that they might use are lit up properly!

You have been tasked with satisfying the cowards by placing
lamps at intersections. For economic reasons, it might not be
possible to place lights at all intersections, so it will
suffice to make sure that there is *a lamp in at least one
of the two intersections adjacent to a trail that could
possibly be used by the joggers*. Some intersections
already have lamps, and of course, you can keep using those
lamps.

You don’t know exactly what trails the joggers are using, but you do know that the joggers will always start and finish at the university campus. You also know that joggers are training for an upcoming marathon, so they always run exactly $S$ meters in total. A jogger might turn around at any point in time, even in the middle of a trail and she can do so as many times as she wants, in order to fulfill the requirement of running exactly $S$ meters.

## Task

You will be given a map of the woods and the jogging trails included in the minimum spanning tree created by the professors. It is guaranteed that there is exactly one route between each pair of intersections, where a route is a set of adjacent trails. Your task is to find the minimum number of additional lamps you needed in order to satisfy the frightened runners, no matter which trails they use (subject to the restrictions above)

## Input

Input starts with two integers $N$ ($2 \leq N \leq 50\, 000$), and $S$ ($1 \leq S \leq 10^4$), the number of intersections and the total distance in meters that a jogger wants to run, respectively. Then follow $N-1$ lines with three integers $a$ ($1 \leq a \leq N$), $b$ ($1 \leq b \leq N$), $d$ ($1 \leq d \leq 100$), meaning that there is a bidirectional trail between intersection $a$ and $b$ with length $d$ meters. Then follows a line with a single integer $L$ ($0 \leq L \leq N$), the number of lamps that have already been placed. Then follow $L$ distinct integers $\ell _1, \dots , \ell _ L$ on one line, meaning there is already a lamp placed at intersections $\ell _1, \dots , \ell _ L$. The university campus is at intersection number 1.

## Output

Output contains a single integer, the minimum number of additional lamps you need to place in order to satisfy the joggers’ requirements.

Sample Input 1 | Sample Output 1 |
---|---|

5 6 1 2 1 1 3 1 4 3 3 3 5 2 1 1 |
1 |

Sample Input 2 | Sample Output 2 |
---|---|

5 6 1 2 1 1 3 1 4 3 3 3 5 2 1 3 |
1 |

Sample Input 3 | Sample Output 3 |
---|---|

5 6 1 3 3 1 4 2 1 5 3 1 2 2 2 4 3 |
1 |