Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-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

E. Pursuit For Artifacts

time limit per test

3 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputJohnny is playing a well-known computer game. The game are in some country, where the player can freely travel, pass quests and gain an experience.

In that country there are *n* islands and *m* bridges between them, so you can travel from any island to any other. In the middle of some bridges are lying ancient powerful artifacts. Johnny is not interested in artifacts, but he can get some money by selling some artifact.

At the start Johnny is in the island *a* and the artifact-dealer is in the island *b* (possibly they are on the same island). Johnny wants to find some artifact, come to the dealer and sell it. The only difficulty is that bridges are too old and destroying right after passing over them. Johnnie's character can't swim, fly and teleport, so the problem became too difficult.

Note that Johnny can't pass the half of the bridge, collect the artifact and return to the same island.

Determine if Johnny can find some artifact and sell it.

Input

The first line contains two integers *n* and *m* (1 ≤ *n* ≤ 3·10^{5}, 0 ≤ *m* ≤ 3·10^{5}) — the number of islands and bridges in the game.

Each of the next *m* lines contains the description of the bridge — three integers *x*_{i}, *y*_{i}, *z*_{i} (1 ≤ *x*_{i}, *y*_{i} ≤ *n*, *x*_{i} ≠ *y*_{i}, 0 ≤ *z*_{i} ≤ 1), where *x*_{i} and *y*_{i} are the islands connected by the *i*-th bridge, *z*_{i} equals to one if that bridge contains an artifact and to zero otherwise. There are no more than one bridge between any pair of islands. It is guaranteed that it's possible to travel between any pair of islands.

The last line contains two integers *a* and *b* (1 ≤ *a*, *b* ≤ *n*) — the islands where are Johnny and the artifact-dealer respectively.

Output

If Johnny can find some artifact and sell it print the only word "YES" (without quotes). Otherwise print the word "NO" (without quotes).

Examples

Input

6 7

1 2 0

2 3 0

3 1 0

3 4 1

4 5 0

5 6 0

6 4 0

1 6

Output

YES

Input

5 4

1 2 0

2 3 0

3 4 0

2 5 1

1 4

Output

NO

Input

5 6

1 2 0

2 3 0

3 1 0

3 4 0

4 5 1

5 3 0

1 2

Output

YES

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/25/2019 10:06:42 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|