#include <bits/stdc++.h>
#define ent '\n'
#define f first
#define s second
#define int long long

using namespace std;
typedef long long ll;
const int maxn = 1e6 + 12;
const int mod = 1e9 + 7;

vector<int> g[maxn];
bool col[maxn];
int p[maxn];
int a[maxn];
int b[maxn];
int n, m, s;

int get(int x){
    if(p[x] == x) return x;
    return p[x] = get(p[x]);
}

void dfs(int v, int p, int c){
    col[v] = c;
    for(int to:g[v]){
        if(to != p){
            dfs(to, v, 1-c);
        }
    }
}

void solve(){
    cin >> n >> m;
    for(int i=1;i<=n;i++){
        p[i] = i;
    }
    vector<pair<int, pair<int, int>>> v;
    while(m--){
        int a, b, c;
        cin >> a >> b >> c;
        v.push_back({c, {a, b}});
    }
    int ans = 0;
    sort(v.begin(), v.end());
    for(auto [w, t]:v){
        auto [x, y] = t;
        if(get(x) != get(y)){
            p[get(x)] = get(y);
            g[x].push_back(y);
            g[y].push_back(x);
            ans = max(ans, w);
        }
    }
    dfs(1, 0, 0);
    cout << ans << ent;
    for(int i=1;i<=n;i++){
        if(col[i]) cout << 'B';
        else cout << 'D';
    }
    cout << ent;
}

signed main(){
    srand(time(0));
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}