Problem Statement

You are given an undirected graph consisting of $N$ vertices and $M$ edges. The vertices are numbered $1$ to $N$, and the edges are numbered $1$ to $M$. In addition, each vertex has a label, A or B. The label of Vertex $i$ is $s_i$. Edge $i$ bidirectionally connects vertex $a_i$ and $b_i$.

The phantom thief Nusook likes to choose some vertex as the startpoint and traverse an edge zero or more times. Today, he will make a string after traveling as above, by placing the labels of the visited vertices in the order visited, beginning from the startpoint.

For example, in a graph where Vertex $1$ has the label A and Vertex $2$ has the label B, if Nusook travels along the path $1 \rightarrow 2 \rightarrow 1 \rightarrow 2 \rightarrow 2$, the resulting string is ABABB.

Determine if Nusook can make all strings consisting of A and B.

Constraints

• $2 \leq N \leq 2 \times 10^{5}$
• $1 \leq M \leq 2 \times 10^{5}$
• $|s| = N$
• $s_i$ is A or B.
• $1 \leq a_i, b_i \leq N$
• The given graph may NOT be simple or connected.

Input

Input is given from Standard Input in the following format:

N M
s
a_1 b_1
:
a_{M} b_{M}

Output

If Nusook can make all strings consisting of A and B, print Yes; otherwise, print No.