#include <bits/stdc++.h>
using namespace std;
long long const N = 2000 + 20, M = 1e5 + 20, INF = 1e18;
struct edge {
  long long u, v, w;
} e[M];
long long n, m, s, t, val[N], x[N], y[N], idx[N], idy[N], dist[N], dp[N][N][2];
vector<long long> adj[N];
bool byX(long long a, long long b) { return x[a] < x[b]; };
bool byY(long long a, long long b) { return y[a] < y[b]; };
void dijk(long long ver) {
  set<pair<long long, long long> > st;
  for (long long i = 1; i <= n; i++) dist[i] = INF;
  dist[ver] = 0;
  for (long long i = 1; i <= n; i++) st.insert({dist[i], i});
  while (st.size()) {
    long long v = st.begin()->second, d = st.begin()->first;
    st.erase(st.begin());
    for (auto ed : adj[v]) {
      long long u = e[ed].u + e[ed].v - v;
      if (!st.count({dist[u], u})) continue;
      st.erase({dist[u], u});
      dist[u] = min(dist[u], dist[v] + e[ed].w);
      st.insert({dist[u], u});
    }
  }
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  cin >> s >> t;
  for (long long i = 1; i <= n; i++) cin >> val[i];
  for (long long i = 0; i < m; i++) {
    cin >> e[i].u >> e[i].v >> e[i].w;
    adj[e[i].u].push_back(i);
    adj[e[i].v].push_back(i);
  }
  dijk(s);
  for (long long i = 1; i <= n; i++) x[i] = dist[i];
  dijk(t);
  for (long long i = 1; i <= n; i++) y[i] = dist[i];
  x[0] = y[0] = -1;
  n++;
  for (long long i = 0; i < n; i++) idx[i] = idy[i] = i;
  sort(idx, idx + n, byX);
  sort(idy, idy + n, byY);
  for (long long i = n - 1; i >= 0; i--) {
    for (long long j = n - 1; j >= 0; j--) {
      if (y[idx[i + 1]] <= y[idy[j]])
        dp[i][j][0] = dp[i + 1][j][0];
      else if (x[idx[i + 1]] == x[idx[i]])
        dp[i][j][0] = dp[i + 1][j][0] + val[idx[i + 1]];
      else
        dp[i][j][0] = val[idx[i + 1]] + max(dp[i + 1][j][0], dp[i + 1][j][1]);
      if (x[idy[j + 1]] <= x[idx[i]])
        dp[i][j][1] = dp[i][j + 1][1];
      else if (y[idy[j + 1]] == y[idy[j]])
        dp[i][j][1] = dp[i][j + 1][1];
      else
        dp[i][j][1] = -val[idy[j + 1]] + min(dp[i][j + 1][0], dp[i][j + 1][1]);
    }
  }
  cout << (dp[0][0][0] ? (dp[0][0][0] > 0 ? "Break a heart" : "Cry")
                       : "Flowers")
       << '\n';
}
