#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cout<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define prArr(a) {cerr<<(#a)<<"={";int i=0;for(auto t:(a))cerr<<(i++?", ":"")<<t;cerr<<"}"<<endl;}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}

class Lowlink{
public:
  int V;
  vector<vector<int> > G;
  vector<int> ord;           //ord[i] := ノードiに訪れた順番
  vector<int> low;           //low[i] := ノードiから訪れることができる最小のord[j]の値。
  vector<int> articulation;
  int ok;
  
  Lowlink():V(-1),ok(false){};
  Lowlink(int V):V(V),G(V),ok(false){};
    
  void add_edge(int a,int b){
    ok = false;
    assert(a < V && b < V);
    assert(a >=0 && b >= 0);
    G[a].push_back(b);
    G[b].push_back(a);
  }
  
  void build(int root = 0){
    ok = true;
    ord.clear(); ord.resize(V,-1);
    low.clear(); low.resize(V,-1);
    articulation.clear(); articulation.resize(V,0); /*関節点用*/
    
    int cnt = 0;
    function<int(int,int)> dfs=[&](int pos,int pre){
      ord[pos] = low[pos] = cnt++;
      for(int to:G[pos]) {
        if(to == pre) continue; 
        if(ord[to] != -1) low[pos] = min(low[pos], ord[to]);
        else {
          low[pos] = min(low[pos], dfs(to, pos));
	  
	  /*関節点用*/
	  if(pos == root) articulation[pos]++;
	  else articulation[pos] |= ord[pos] <= low[to];
	  
	}
      }
      return low[pos];
    };
    
    dfs(root , -1);
    articulation[root] = articulation[root] >= 2; /*関節点用*/
  }

  int isBridge(int a,int b){
    assert(ok);
    assert(a < V && b < V);
    assert(a >= 0 && b >= 0);
    if(ord[a] > ord[b]) swap(a, b);
    return ord[a] < low[b];
  }
  
  int isArticulation(int a){
    assert(ok);
    assert(a >= 0 && a < V);
    return articulation[a];
  }
};

template<typename ctype, ctype INF>
class Dijkstra{
public:
  typedef tuple<int,ctype> T;  //for edge
  typedef tuple<ctype,int> T2; //for priority_queue
  int V;
  vector<vector<T> > G;
  vector<vector<T> > rG;
  
  Dijkstra():V(-1){}
  Dijkstra(int V):V(V),G(V),rG(V){}
  
  void add_edge(int a,int b,ctype c,int oneway = 0){
    assert(a >= 0 && b >= 0);
    assert(a < V && b < V);
    G[a].push_back(T(b, c));
    rG[b].push_back(T(a, c));
    if(!oneway) G[b].push_back(T(a, c)), rG[a].push_back(T(b, c));
  }

  vector<ctype> dijkstra(int start, int rev = 0){
    vector<ctype> D(V, INF);
    vector<int> visited(V,0);
    priority_queue<T2, vector<T2>, greater<T2> > Q;
    Q.push(T2(0, start));
    D[start] = 0;
    while(!Q.empty()){
      ctype cost;
      int pos;
      tie(cost,pos) = Q.top(); Q.pop();
      assert(!visited[pos] || D[pos] <= cost);
      if(visited[pos]++) continue;
      
      for(auto t:rev == 0? G[pos]:rG[pos]){
	int to = get<0>(t);
        ctype ncost = cost + get<1>(t);
        if(D[to] <= ncost) continue;
        D[to] = ncost;
        Q.push(T2(ncost, to));
      }
    }
    return D;
  }
  
  vector<vector<int> > getDAG(int start, int goal){
    auto DS = dijkstra(start, 0);
    auto DT = dijkstra(goal, 1);
    vector<vector<int> > DAG(V);
    vector<int> visited(V,0);
    queue<int> Q;
    Q.push(start);
    while(!Q.empty()){
      int pos; pos = Q.front(); Q.pop();
      if(visited[pos]++) continue;
      
      for(auto t:G[pos]){
        int to = get<0>(t);
        ctype cost = get<1>(t);
	if(DS[pos] + DT[to] + cost != DS[goal]) continue;
	Q.push(to);
	DAG[pos].push_back(to);
      }
    }
    return DAG;
  }
};

using T = tuple<int,int,int>;
const int start = 0,  goal= 1;
int n, m;
vector<T> edge;
vector<Int> DS, DT;
Lowlink lowlink;

int happy(int i){
  int a, b, c; tie(a, b, c) = edge[i];
  return DS[goal] > DS[b] + DT[a] + c;
}

int  soso(int i){
  int a, b, c; tie(a, b, c) = edge[i];
  if(DS[a] + DT[b] + c != DS[goal]) return 1;
  return !lowlink.isBridge(a, b);
}


signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  cin>>n>>m;
  edge.resize(m);
  Dijkstra<Int, INF> dijkstra(n);
  Dijkstra<Int, INF> dijkstra2(n);
  
  for(int i=0;i < m;i++){
    Int a, b, c;
    cin>>a>>b>>c; a--,b--;
    edge[i] = T(a, b, c);
    dijkstra.add_edge(a, b, c, 1);
    dijkstra2.add_edge(b, a, c, 1);
  }
  DS = dijkstra.dijkstra(start);
  DT = dijkstra2.dijkstra(goal);

  auto G = dijkstra.getDAG(start, goal);
  lowlink = Lowlink(n);
  for(int i=0;i<n;i++)
    for(int to:G[i]) lowlink.add_edge(i, to);

  lowlink.build();

  for(int i=0;i<m;i++){
    if(happy(i)) cout<<"HAPPY"<<endl;
    else if(soso(i)) cout<<"SOSO"<<endl;
    else cout<<"SAD"<<endl;
  }

  return 0;
}



Measured memory_bytes: 48880