#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define lint long long
#define pii pair<int, int>
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define SZ(v) ((int)v.size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MINF(a) memset(a, 0x3f, sizeof(a))
#define POW(n) (1LL << (n))
#define POPCNT(n) (__builtin_popcount(n))
#define IN(i,a,b) (a <= i && i <= b)
using namespace std;
template <typename T> inline bool CHMIN(T& a,T b) { if(a>b) { a=b; return 1; } return 0; }
template <typename T> inline bool CHMAX(T& a,T b) { if(a<b) { a=b; return 1; } return 0; }
template <typename T> inline void SORT(T& a) { sort(ALL(a)); }
template <typename T> inline void REV(T& a) { reverse(ALL(a)); }
template <typename T> inline void UNI(T& a) { sort(ALL(a)); a.erase(unique(ALL(a)),a.end()); }
template <typename T> inline T LB(vector<T>& v, T a) { return *lower_bound(ALL(v),a); }
template <typename T> inline int LBP(vector<T>& v, T a) { return lower_bound(ALL(v),a) - v.begin(); }
template <typename T> inline T UB(vector<T>& v, T a) { return *upper_bound(ALL(v),a); }
template <typename T> inline int UBP(vector<T>& v, T a) { return upper_bound(ALL(v),a) - v.begin(); }
template <typename T1, typename T2> ostream& operator<< (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os; }
template <typename T1, typename T2> istream& operator>> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template <typename T> ostream& operator<< (ostream& os, const vector<T>& v) { REP(i,v.size()) { if (i) os << " "; os << v[i]; } return os; }
template <typename T> istream& operator>> (istream& is, vector<T>& v) { for(T& in : v) is >> in; return is; }
template <typename T = int> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); }
template <typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); }
const lint MOD = 1000000007;
const lint INF = 0x3f3f3f3f3f3f3f3f;
const double PI = 3.14159265358979323846;
const double EPS = 1e-10;

template <typename T> struct Edge {
    int to;
    T cost;
    Edge() {}
    Edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using Edges = vector<Edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;


// Dijkstra のアルゴリズム
// 負辺を持つグラフは受け付けない
template <typename T> vector<T> dijkstra(WeightedGraph<T> &g, int s, T inf = numeric_limits<T>::max()) {
    const int n = g.size();
    vector<T> dis(n, inf);
    using P = pair<int, int>;
    priority_queue<P, vector<P>, greater<P>> que;

    dis[s] = 0;
    que.emplace(0, s);
    while (!que.empty()) {
        const P p = que.top();
        const int u = p.second;
        que.pop();
        if (dis[u] < p.first) continue;
        for (auto &e : g[u]) {
            const int v = e.to;
            if (dis[v] > dis[u] + e.cost) {
                dis[v] = dis[u] + e.cost;
                que.emplace(dis[v], v);
            }
        }
    }
    return dis;
}

class LowLink {
    void dfs(int u, int &k, int p = -1) {
        low[u] = ord[u] = k++;

        // 関節点の判定に使用
        int num_of_child = 0;
        bool exist = false;

        for (auto &v : g[u]) if (v != p) {
            if (ord[v] >= 0) {
                low[u] = min(low[u], ord[v]);   // back edge
                continue;
            }
            dfs(v, k, u);
            low[u] = min(low[u], low[v]);   // forward edge
            if (ord[u] < low[v]) brs.emplace_back(minmax(u, v));
            if (ord[u] <= low[v]) exist = true;
            ++num_of_child;
        }
        if ((p == -1 && num_of_child > 1) || (p != -1 && exist))
            aps.emplace_back(u);
    }

    // Lowlinkを実行
    void build() {
        const int n = g.size();
        ord.assign(n, -1);
        low.resize(n);
        int k = 0;
        for (int i = 0; i < n; ++i) {
            if (ord[i] < 0) dfs(i, k);
        }
        sort(brs.begin(), brs.end());
        sort(aps.begin(), aps.end());
    }

public:
    using UnweightedGraph = vector<vector<int>>;
    vector<pair<int, int>> brs; // 橋
    vector<int> aps; // 関節点

    const UnweightedGraph &g;
    vector<int> ord, low;

    LowLink(const UnweightedGraph &g) : g(g) { build(); }
};

int n, m;
int a[100010], b[100010], c[100010];
WeightedGraph<int> g1, g2;
vector<vector<int>> g;

void _main() {
    cin >> n >> m;
    g1.resize(n);
    g2.resize(n);
    REP(i, m) {
        cin >> a[i] >> b[i] >> c[i];
        a[i]--; b[i]--;
        g1[a[i]].emplace_back(b[i], c[i]);
        g2[b[i]].emplace_back(a[i], c[i]);
    }
    auto d1 = dijkstra(g1, 0, INF);
    auto d2 = dijkstra(g2, 1, INF);
    g.resize(n);
    vector<int> used(m, false);
    for (int i = 0; i < m; ++i) {
        if (d1[a[i]] + c[i] + d2[b[i]] == d1[1]) {
            g[a[i]].emplace_back(b[i]);
            g[b[i]].emplace_back(a[i]);
            used[i] = true;
        }
    }
    LowLink ll(g);
    REP(i, m) {
        int dis = d1[b[i]] + d2[a[i]] + c[i];
        if (dis < d1[1]) {
            cout << "HAPPY" << endl;
        } else if (!used[i] || ll.brs.empty()) {
            cout << "SOSO" << endl;
        } else {
            auto p = make_pair(min(a[i], b[i]), max(a[i], b[i]));
            auto q = LB(ll.brs, p);
            cout << (p == q ? "SAD" : "SOSO") << endl;
        }
    }
}

signed main(signed argc, char **argv) {
    if (argc > 1) {
        if (strchr(argv[1], 'i')) freopen("input.txt", "r", stdin);
        if (strchr(argv[1], 'o')) freopen("output.txt", "w", stdout);
    }
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    _main();
    return 0;
}


Measured memory_bytes: 34856