#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cassert>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <complex>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <iterator>

using namespace std;

#define dump(n) cout<<"# "<<#n<<'='<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define iter(c) __typeof__((c).begin())
#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();++i)
#define all(c) (c).begin(),(c).end()
#define mp make_pair

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int,int> pii;

const int INFTY=1<<29;
const double EPS=1e-9;

template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& p){
	return os<<'('<<p.first<<','<<p.second<<')';
}
template<typename T>
ostream& operator<<(ostream& os,const vector<T>& a){
	os<<'[';
	rep(i,a.size()) os<<(i?" ":"")<<a[i];
	return os<<']';
}

int main()
{
	for(int n,m,nf,ne,s,d;scanf("%d%d%d%d%d%d",&n,&m,&nf,&ne,&s,&d),n|m|nf|ne|s|d;){ // 頂点数,何分保つか,冷凍施設数,辺数,首都の番号,病院の番号
		vi fs(nf);
		rep(i,nf) scanf("%d",&fs[i]);
		vvi dp(n,vi(n,INFTY));
		rep(i,n) dp[i][i]=0;
		rep(i,ne){
			int a,b,t; scanf("%d%d%d",&a,&b,&t);
			dp[a][b]=dp[b][a]=t;
		}
		
		rep(k,n) rep(i,n) rep(j,n)
			dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);
		
		vvi dp2(n,vi(n,INFTY));
		rep(i,n) dp2[i][i]=0;
		dp2[s][d]=dp[s][d]<=m?dp[s][d]:INFTY;
		rep(i,nf){
			dp2[s][fs[i]]=dp[s][fs[i]]<=m?dp[s][fs[i]]:INFTY;
			dp2[fs[i]][d]=dp[fs[i]][d]<=m?dp[fs[i]][d]:INFTY;
			rep(j,nf)
				dp2[fs[i]][fs[j]]=dp[fs[i]][fs[j]]<=m?dp[fs[i]][fs[j]]:INFTY;
		}
		
		rep(k,n) rep(i,n) rep(j,n)
			dp2[i][j]=min(dp2[i][j],dp2[i][k]+dp2[k][j]);
		
		if(dp2[s][d]==INFTY)
			cout<<"Help!"<<endl;
		else
			cout<<dp2[s][d]+max(dp2[s][d]-m,0)<<endl;
	}
	
	return 0;
}