Rainbow Graph

Roy and Biv have an undirected graph with $n$ nodes, numbered $1..n$. Each edge of the graph has a weight and a color. Weights are positive integers. There are exactly three colors of edges: Red, Green, and Blue. There may be multiple edges between the same two vertices, and there may even be self-loops in the graph.

For a fixed positive integer $k$, consider the following task: Roy and Biv want to choose exactly $k$ edges of their graph and erase all other edges. They want to do this in such a way that when they look at the graph with just the $k$ edges they have chosen, they will both see that the entire graph is connected.

However, there is a catch: Roy cannot see the color Red and Biv cannot see the color Blue. Therefore, they have to choose the edges in such a way that the Blue and Green edges are enough to connect all nodes, and also the Red and Green edges are enough to connect all nodes. What is the minimum combined weights for all of the edges which will allow both Roy and Biv to see the graph as connected, for all values of $k$ from $1$ to the total number of edges?

Input

Each input will consist of a single test case. Note that your program may be run multiple times on different inputs. Each test case will begin with a line with two integers, $n$ and $m$ ($1 \le n,m \le 100$), where $n$ is the number of nodes in the graph, and $m$ is the number of edges.

Each of the next $m$ lines will contain three integers and a character, $a$, $b$ ($1 \le a,b \le n$), $w$ ($1 \le w \le 1\, 000$) and $c$ ($c \in \{ R,G,B\} $), which represents an edge between nodes $a$ and $b$ with weight $w$, and color $c$ ($R$=Red, $G$=Green, $B$=Blue).

Output

Output $m$ lines, with each line representing a result for $k=1..m$ in order. If it is not possible for both Roy and Biv to see the graph as connected, output $-1$ for that value of $k$. Otherwise, output the minimum sum of edge weights for a subset of $k$ edges which will allow both Roy and Biv to see the graph as connected.

Sample Input 1 Sample Output 1
5 8
1 5 1 R
2 1 2 R
5 4 5 R
4 5 3 G
1 3 3 G
4 3 5 G
5 4 1 B
1 2 2 B
-1
-1
-1
-1
15
14
17
22