\begin{problem}{Parties}{standard input}{standard output}{4 seconds}

%Problem author: Pavel Mavrin
%Original statement: Sergey Poromov
%English translation: Maxim Buzdalov

In Byteland, there are $n$ cities connected by highways. Each highway is bidirectional and has a certain length.
There are also two parties. The first one declares that, when having dinner, everybody must keep a fork in the left hand, 
the second one is strictly for the right hand. Each of the cities in Byteland have chosen exactly one of these parties to support.
However, from time to time, revolutions take place in this or that city, and the other party takes place of its opponent.

The government of Byteland has offered you to write a program which, for every moment of time, should estimate the political stability in the 
country. The mathematical model, developed by the leading scientists, shows that the stability depends on how close are the cities which
support the same party, because the closer they are, the more is the probability that they will form a coalition.

So the program that you are to write must, given the information about all the cities, highways and revolutions, find, after each revolution,
two cities that support the same party and having the smallest distance between them.

\InputFile

The first line of the input contains three integers $n$, $m$ и $k$ ($1 \le n, m, k \le 100{\,}000$)~--- 
the numbers of cities, highways and revolutions, correspondingly.

The second line contains a string $s$ of length $n$, which describes the political situation at the initial moment.
At $i$-th position, the symbol \texttt{L} denotes that $i$-th city supports the left-hand-party, and the symbol \texttt{R} is for the right-hand one.

The next $m$ lines contain three integers each: $a_i$, $b_i$ и $l_i$ ($1 \le a_i, b_i \le n$, $a_i \neq b_i$, $1 \le l_i \le 10^9$)~---
the numbers of the cities connected by the $i$-th highway, and the length of this highway. Each pair of the cities is connected by not
more than one highway.

The next $k$ lines contain the number of cities $c_j$ ($1 \le c_j \le n$), where revolutions happened, in the order of these events.
Because the cities are, in general, quite conservative, in every city there have been no more than one revolution, so all $c_j$ are different.

\OutputFile

Output $k + 1$ reports about the closest cities that may form a coalition.
The first report must correspond to the initial moment, and every next report must describe the situation after next revolution.

Every report must be output on a separate line and must contain three integers $d_i$, $x_i$ и $y_i$~--- 
the minimal distance between the cities that support the same party, and the numbers of these cities, respectively.
If there are several such pairs of cities, output the data for any of them. It is guaranteed that there will be at least one such pair.

\Examples
\begin{example}%
\exmp{
5 6 4
LRLRL
1 4 1
2 3 2
3 4 3
4 5 4
2 5 5
2 4 6
1
4
3
5
}{
4 1 3
1 4 1
3 3 4
2 3 2
2 2 3
}%
\end{example}

\Note
Solutions assuming that $n \le 100$ will receive at least 30 points.

Solutions assuming that $n \le 2000$ will receive at least 60 points.
\end{problem}
