#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
inline bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T>
inline bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

template <typename T>
struct Edge {
  int from, to;
  T cost;
  Edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}
  Edge(int from, int to) : from(from), to(to), cost(1) {}
  bool operator<(Edge<T> &r) {
    return cost < r.cost;
  }
};
template <typename T>
ostream &operator<<(ostream &os, Edge<T> edge) {
  os << edge.from << " -> " << edge.to << " (" << edge.cost << ")";
  return os;
}

// グラフテンプレート(隣接リスト)
template <typename E = Edge<ll>>
struct GraphL {
  // 頂点数、辺数
  int n, m;
  // 隣接リスト
  vector<vector<E>> adj;
  GraphL(int n)
      : n(n), m(0), adj(n) {}

  template <typename... Args>
  void add_edge(int from, int to, Args... args) {
    adj[from].emplace_back(from, to, args...);
    m++;
  }
};
template <typename E = Edge<ll>>
ostream &operator<<(ostream &os, GraphL<E> graph) {
  os << "V = " << graph.n << ", E = " << graph.m << "\n";
  for (const auto &ev : graph.adj) {
    for (const auto &e : ev) {
      os << e << "\n";
    }
  }
  return os;
}


int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll n, m;
  cin >> n >> m;
  vll d(n);
  rep(i, n){
    cin >> d[i];
  }
  GraphL<> g(n);
  vll u(m), v(m);
  map<pll, ll> mp;
  rep(i, m){
    cin >> u[i] >> v[i];
    u[i]--;
    v[i]--;
    g.add_edge(u[i], v[i], 1000000000);
    g.add_edge(v[i], u[i], 1000000000);
    mp.insert(make_pair(pll(u[i], v[i]), 1000000000));
  }
  vi color(n, 0);
  auto dfs = [&](auto& Self, int node, int de) -> void{
    color[node] = 2;
    if(!de){
      for(auto&& e: g.adj[node]){
        if(!color[e.to] && d[e.to] >= d[node]){
          e.cost = d[e.to] - d[node];
          if(mp.count(pll(e.from, e.to))) mp[pll(e.from, e.to)] = e.cost;
          if(mp.count(pll(e.to, e.from))) mp[pll(e.to, e.from)] = e.cost;
          Self(Self, e.to, de+1);
        }else if(!color[e.to] && d[e.to] < d[node]){
          e.cost = 1000000000;
          if(mp.count(pll(e.from, e.to))) mp[pll(e.from, e.to)] = e.cost;
          if(mp.count(pll(e.to, e.from))) mp[pll(e.to, e.from)] = e.cost;
        }
      }
    }else{
      for(auto&& e: g.adj[node]){
        if(!color[e.to] && d[e.to] > d[node]){
          e.cost = d[e.to] - d[node];
          if(mp.count(pll(e.from, e.to))) mp[pll(e.from, e.to)] = e.cost;
          if(mp.count(pll(e.to, e.from))) mp[pll(e.to, e.from)] = e.cost;
          Self(Self, e.to, de+1);
        }else if(!color[e.to] && d[e.to] <= d[node]){
          e.cost = 1000000000;
          if(mp.count(pll(e.from, e.to))) mp[pll(e.from, e.to)] = e.cost;
          if(mp.count(pll(e.to, e.from))) mp[pll(e.to, e.from)] = e.cost;
        }
      }
    }
  };
  set<pll> st;
  rep(i, n){
    st.emplace(d[i], i);
  }
  for(auto&& e: st){
    ll i = e.second;
    if(!color[i]){
      ll tmp = INF;
      for(auto&& ee: g.adj[i]){
        if(!color[ee.to]){
          chmin(tmp, d[ee.to]);
        }
      }
      if(tmp == d[i]){
        dfs(dfs, i, 0);
        color[i] = 1;
      }
    }
  }
  dump(color);
  
  string ans = "";
  rep(i, n){
    if(!color[i]){
      print(-1);
      return 0;
    }
    if(color[i] == 1){
      ans += "B";
    }
    if(color[i] == 2){
      ans += "W";
    }
  }
  rep(i, m){
    print(mp[pll(u[i], v[i])]);
  }
  /*
  {
    bool f = 0;
    rep(i, m){
      if(d[u[i]] == d[v[i]]){
        f = 1;
        break;
      }
    }
    if(!f){
      print(-1);
      return 0;
    }
  }
  */
  
}
