Problem:
Score : 900 points

Problem Statement

We have a connected undirected graph with N vertices and M edges.
Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally.
We are additionally given N integers D_1, D_2, ..., D_N.

Determine whether the conditions below can be satisfied by assigning a color - white or black - to each vertex and an integer weight between 1 and 10^9 (inclusive) to each edge in this graph.
If the answer is yes, find one such assignment of colors and integers, too.

There is at least one vertex assigned white and at least one vertex assigned black.

For each vertex v (1 \leq v \leq N), the following holds.

The minimum cost to travel from Vertex v to a vertex whose color assigned is different from that of Vertex v by traversing the edges is equal to D_v.

Here, the cost of traversing the edges is the sum of the weights of the edges traversed.

Constraints

2 \leq N \leq 100,000

1 \leq M \leq 200,000

1 \leq D_i \leq 10^9

1 \leq U_i, V_i \leq N

The given graph is connected and has no self-loops or multiple edges.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N M
D_1 D_2 ... D_N
U_1 V_1
U_2 V_2
\vdots
U_M V_M

Output

If there is no assignment satisfying the conditions, print a single line containing -1.

If such an assignment exists, print one such assignment in the following format:

S
C_1
C_2
\vdots
C_M

Here,

the first line should contain the string S of length N. Its i-th character (1 \leq i \leq N) should be W if Vertex i is assigned white and B if it is assigned black.

The (i + 1)-th line (1 \leq i \leq M) should contain the integer weight C_i assigned to Edge i.

Sample Input 1

5 5
3 4 3 5 7
1 2
1 3
3 2
4 2
4 5

Sample Output 1

BWWBB
4
3
1
5
2

Assume that we assign the colors and integers as the sample output, and let us consider Vertex 5, for example. To travel from Vertex 5, which is assigned black, to a vertex that is assigned white with the minimum cost, we should make these moves: Vertex 5 \to Vertex 4 \to Vertex 2. The total cost of these moves is 7, which satisfies the condition. We can also verify that the condition is satisfied for other vertices.

Sample Input 2

5 7
1 2 3 4 5
1 2
1 3
1 4
2 3
2 5
3 5
4 5

Sample Output 2

-1

Sample Input 3

4 6
1 1 1 1
1 2
1 3
1 4
2 3
2 4
3 4

Sample Output 3

BBBW
1
1
1
2
1
1

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

use std::collections::{BinaryHeap, VecDeque};

const INF: i64 = 1e9 as i64;

fn main() {
    let (r, w) = (std::io::stdin(), std::io::stdout());
    let mut sc = IO::new(r.lock(), w.lock());

    let n: usize = sc.read();
    let m: usize = sc.read();
    let d: Vec<i64> = sc.vec(n);
    let mut graph = vec![vec![]; n];

    for i in 0..m {
        let u = sc.read::<usize>() - 1;
        let v = sc.read::<usize>() - 1;
        graph[u].push((v, i));
        graph[v].push((u, i));
    }

    let mut color = vec![0; n];
    let mut edge_cost = vec![INF; m];
    let min_d = *d.iter().min().unwrap();
    let mut heap = BinaryHeap::new();
    for i in 0..n {
        if d[i] != min_d {
            continue;
        }
        if color[i] == 0 {
            color[i] = 1;
        }
        for &(next, edge) in graph[i].iter() {
            if d[next] != min_d {
                continue;
            }
            if color[next] == color[i] {
                continue;
            }
            if color[next] == 0 {
                color[next] = if color[i] == 1 { 2 } else { 1 };
            }
            edge_cost[edge] = min_d;
        }
        heap.push((-d[i], i));
    }
    for i in 0..n {
        assert!(color[i] == 0 || d[i] == min_d);
        assert_ne!(color[i] == 0, d[i] == min_d);
    }

    while let Some((_, v)) = heap.pop() {
        for &(next, edge) in graph[v].iter() {
            if color[next] != 0 {
                continue;
            }

            // assert!(d[v] <= d[next]);
            color[next] = if color[v] == 1 { 2 } else { 1 };
            assert_eq!(edge_cost[edge], INF);
            edge_cost[edge] = d[next];
            heap.push((-d[next], next));
        }
    }

    for i in 0..n {
        let min_cost = graph[i]
            .iter()
            .filter(|&&(next, _)| color[i] != color[next])
            .map(|&(_, edge)| edge_cost[edge])
            .min()
            .unwrap();
        if min_cost != d[i] {
            println!("-1");
            return;
        }
    }

    for i in 0..n {
        if color[i] == 1 {
            sc.write("B");
        } else {
            assert_eq!(color[i], 2);
            sc.write("W");
        }
    }
    sc.write("\n");

    for i in 0..m {
        sc.write(edge_cost[i]);
        sc.write("\n");
    }
}

pub struct IO<R, W: std::io::Write>(R, std::io::BufWriter<W>);

impl<R: std::io::Read, W: std::io::Write> IO<R, W> {
    pub fn new(r: R, w: W) -> Self {
        IO(r, std::io::BufWriter::new(w))
    }
    pub fn write<S: ToString>(&mut self, s: S) {
        use std::io::Write;
        self.1.write(s.to_string().as_bytes()).unwrap();
    }
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .0
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r' || b == b'\t')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r' && b != b'\t')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}