#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define ll long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5+7, P1 = 31, P2 = 37, mod= 1e9 + 7;

int mul(int a, int b) {
    return (1LL * a * b) % mod;
}

int add(int a, int b) {
    a = (a + mod) % mod;
    b = (b + mod) % mod;
    return (a + b) % mod;
}

int fp(int b, int p) {
    if (b == 1 or p == 0)
        return 1;

    int ret = fp(b, p >> 1);
    ret = mul(ret, ret);

    if (p & 1)
        ret = mul(ret, b);

    return ret;
}

ll modInv(ll n) {
    return fp(n, mod - 2);
}

ll fact[N], inv[N];

void pre() {
    fact[0] = inv[0] = 1;
    for (ll i = 1; i < N; i++)
        fact[i] = (fact[i - 1] * i) % mod, inv[i] = fp(fact[i], mod - 2);
}

ll nCr(ll n, ll r) {
    return ((fact[n] * inv[r]) % mod * inv[n - r]) % mod;
}

ll nPr(ll n, ll r) {
    return ((fact[n] * inv[n - r])) % mod;
}
set<int> st;
int dp[101][101][101];
vector<pair<int,pair<int,int>>> adj[N];
void dfs(int r , int b , int y, int id)
{
    if (~id)
        st.insert(id);
    if (~dp[r][b][y])
        return;
    dp[r][b][y] = 1;


    for(auto &[to, c]  : adj[r])
    {
        if ( c.first   <= 1)
         dfs(to , b,y, c.second);
        if ( c.first == 3 && b == r)
            dfs(to, to, y,c.second);
        if ( c.first == 5 && y == r)
            dfs(to , b , to , c.second);
    }
    for(auto &[to, c]  : adj[b])
    {
        if ( c.first == 2 || c.first == 0)
            dfs(r , to,y, c.second);
        if ( c.first == 6 && b == y)
            dfs(r, to, to,c.second);
    }
    for(auto &[to, c]  : adj[y])
    {
        if ( c.first == 4 || c.first == 0)
            dfs(r , b, to, c.second);
    }


}
void doWork() {
     int n,m , r,b,y;
     cin >> n >> m >> r >> b >> y;
     vector<pair<pair<int,int> , int>> edge;
     int cnt = 0 , nonz =0 ;
     for (int i = 0; i < m; ++i) {
        int msk = 0;
        int u,v;
        char c;
        cin >> u >> v >> c;
        if ( c == 'R')
            msk = 1;
        else if ( c == 'B')
            msk = 2;
        else if ( c == 'Y')
            msk = 4;
        else if ( c == 'P')
            msk = 3;
        else if (c == 'O')
            msk = 5;
        else if ( c == 'G')
            msk = 6;
        if ( msk) {
            adj[u].push_back({v, {msk, cnt}});
            adj[v].push_back({u, {msk, cnt++}});
        }
        else
        {
            adj[u].push_back({v, {msk, -1}});
            adj[v].push_back({u, {msk, -1}});
        }
        nonz+=(msk > 0);
     }
    memset(dp,-1,sizeof dp);
    dfs(r,b,y,-1);
    cout << (nonz == st.size()) << endl;
}


int main() {
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
    int t = 1;
    //cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}