Don't Copy the Manga

Toka fell for the beautiful Hanbyeol senior she happened to run into! She wanted to talk to him but did not have the nerve, so she started looking for an excuse to speak to him. Toka reads a lot of manga, and in one comic she found a way to make that excuse. In the story, the male and female leads became friends after bumping into each other under cherry blossoms on the way to school. Toka decided to copy it.

Toka's neighborhood has no cherry trees, so she plans to try it at a place with ginkgo trees instead. Her neighborhood has $N$ ginkgo trees numbered from $1$ to $N$, and $M$ roads with a ginkgo tree at each end. Every road can be traveled in both directions, and any two ginkgo trees can always be reached from each other. Two different ginkgo trees may be connected by more than one road.

Hanbyeol likes open places. When he moves from one ginkgo tree to an adjacent one, he goes to the tree with the most roads connected to it. If several trees tie, he goes to the one with the largest number. Following only roads with many connections could make him circle the same roads forever, so he takes the route that passes through the fewest ginkgo trees on the way to school. Even if a tree has many roads, he does not head there if he cannot reduce the number of trees he passes through.

Toka wants to spend more time with Hanbyeol, so she plans to bump into him at the ginkgo tree on his route to school that she can reach from her house the fastest. If several trees tie, she will bump into him at the one with the smallest number. Since Toka is getting ahead of herself, you need to tell her the number of the ginkgo tree where she and Hanbyeol are fated to collide.

The first line contains the number of ginkgo trees $N$ ($3 \le N \le 100\,000$) and the number of roads $M$ ($2 \le M \le 300\,000$), separated by a space.

The second line contains $A$, the number of the ginkgo tree next to Toka's house, $B$, the number of the ginkgo tree next to Hanbyeol's house, and $C$, the number of the ginkgo tree next to the school, separated by spaces. ($1 \le A, B, C \le N$; $A \neq B$; $A \neq C$; $B \neq C$)

From the third line onward, $M$ lines follow. Each line contains the numbers $i$ and $j$ of the ginkgo trees at the two ends of a road ($1 \le i, j \le N$; $i \neq j$) and the time $k$ it takes to travel along the road ($1 \le k \le 10^9$), separated by spaces.

Print the number of the ginkgo tree where Toka must go to meet her fate.