#include <bits/stdc++.h>
using namespace std;
vector<int> g[40001];
queue<pair<int,int>> qa;
queue<pair<int,int>> qb;
vector<int> tav;
vector<bool> seen;
void bfsa(int a){
    queue<int> q;
    tav[a]=0;
    q.push(a);
    seen[a]=true;
    while (!q.empty()){
        int v=q.front();
        q.pop();
        qa.push({v,tav[v]});
        for (int edge:g[v]){
            if (!seen[edge]){
                q.push(edge);
                seen[edge]=true;
                tav[edge]=tav[v]+1;

            }
        }
    }
}
void bfsb(int a){
    queue<int> q;
    tav[a]=0;
    q.push(a);
    seen[a]=true;
    while (!q.empty()){
        int v=q.front();
        q.pop();
        qb.push({v,tav[v]});
        for (int edge:g[v]){
            if (!seen[edge]){
                q.push(edge);
                seen[edge]=true;
                tav[edge]=tav[v]+1;

            }
        }
    }
}
int main()
{
    int n,m,a,b;
    cin>>n>>m>>a>>b;
    for (int i=0; i<m;i++){
        int a,b;
        cin>>a>>b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    tav.resize(n+1,0);
    seen.resize(n+1,0);
    bfsa(a);
    tav.clear();
    seen.clear();
    tav.resize(n+1,0);
    seen.resize(n+1,0);
    bfsb(b);
    seen.clear();
    seen.resize(n+1,0);
    int cnt=0;
    int ans=0;
    vector<string> ct;
    ct.resize(n+1);
    while (cnt!=n/2){
        while (seen[qa.front().first]){
            qa.pop();
        }
        ans+=qa.front().second;
        seen[qa.front().first]=true;
        ct[qa.front().first]="A";
        qa.pop();
        while (seen[qb.front().first]){
            qb.pop();
        }
        ans+=qb.front().second;
        seen[qb.front().first]=true;
        ct[qb.front().first]="B";
        qb.pop();
        cnt++;
    }
    cout<<ans<<endl;
    for (int i=1; i<=n;i++) cout<<ct[i];
}