#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< 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;}
//INSERT ABOVE HERE

template<typename ctype, ctype INF>
class Dijkstra{
public:
  typedef tuple<Int, ctype> T;  //for edge
  typedef tuple<ctype, Int, Int> T2; //for priority_queue
  Int V;
  vector<vector<T> > G;
  vector<vector<T> > rG;
  Int Limit;
  vector<Int> A;

  Dijkstra():V(-1){}
  Dijkstra(Int V):V(V),G(V),rG(V),A(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<vector<ctype> > dijkstra(Int start, Int rev = 0){
    vector<vector<ctype> > D(V, vector<ctype>(Limit+1, INF));
    vector<vector<Int> > visited(V,vector<Int>(Limit+1, 0));
    priority_queue<T2, vector<T2>, greater<T2> > Q;
    Q.push(T2(0, start, Limit));
    D[start][Limit] = 0;
    while(!Q.empty()){
      ctype cost;
      Int pos;
      Int cnt;
      tie(cost, pos, cnt) = Q.top(); Q.pop();
      assert(!visited[pos][cnt] || D[pos][cnt] <= cost);
      if(visited[pos][cnt]++) continue;

      for(Int i=0;i<=Limit;i++){
        for(auto t:rev == 0? G[pos]:rG[pos]){
          if(A[pos] == 0 && i != 0) continue;
          Int to = get<0>(t);
          ctype ncost = cost + get<1>(t) + i;
          Int ncnt = cnt + i - get<1>(t);
          if(cnt+i > Limit || ncnt < 0 || D[to][ncnt] <= ncost) continue;
          D[to][ncnt] = ncost;
          Q.push(T2(ncost, to, ncnt));
        }
      }
    }
    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;
  }
};


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

  while(1){
    Int N, Limit, L, M, start, goal;
    cin>>N>>Limit>>L>>M>>start>>goal;
    if(N == 0) break;

    Dijkstra <Int, INF> dij(N);
    dij.Limit = Limit;
    for(Int i=0;i<L;i++){
      Int l;
      cin>>l;
      dij.A[l] = 1;
    }

    for(Int i=0;i<M;i++){
      Int a, b, c;
      cin>>a>>b>>c;
      dij.add_edge(a, b, c);
    }


    auto D = dij.dijkstra(start);
    Int ans = INF;
    for(Int i=0;i<=Limit;i++) Min(ans, D[goal][i]);
    if(ans == INF) cout<<"Help!"<<endl;
    else cout<<ans<<endl;
  }
  return 0;
}



Measured memory_bytes: 3844