Hotel Booking - or something

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (1<<14)
#define MT (601)
int cn[MX][MT],H[MX];
struct eg{
    int v,t,m;
    bool operator<(const eg&r)const{return v>r.v;}
};
vector<int> g[MX],v[MX];
int dj(int f,int t){
    priority_queue<eg> q;
    q.push({0,f,0});
    CL(cn,-1);
    while(!q.empty()){
        int a(q.top().t),s(q.top().m),w(q.top().v);
        cn[a][s]=w;
        if(a==t)return w;
        F((ll)g[a].size())if(v[a][i]+s<=600)
            q.push({w,g[a][i],v[a][i]+s});
        if(H[a])F((ll)g[a].size())
            q.push({w+1,g[a][i],v[a][i]});
        while(!q.empty()&&~cn[q.top().t][q.top().m])
            q.pop();
    }
    return -1;
}
#define ADD(A,B,V) (g[A].push_back(B),g[B].push_back(A),v[A].push_back(V),v[B].push_back(V))
int N,a,b,c;
int main(void){
    while(scanf("%d",&N),N){
        CL(H,0);
        IN(h)F(h)scanf("%d",&a),H[--a]=1;
        IN(Q)F(Q)scanf("%d%d%d",&a,&b,&c),--a,--b,ADD(a,b,c);
        printf("%d\n",dj(0,N-1));
        F(N)g[i].clear(),v[i].clear();
    }
    return 0;
}