1 #include<iostream>
 2 #include<cstdio>
 3 #include<vector>
 4 #include<string.h>
 5 #include<queue>
 6 #include<utility>
 7 #define INF 0x3f3f3f3f
 8
 9 using namespace std;
10 typedef pair<int,int> P;
11
12 struct node
13 {
14     int to,w;
15     node(int v,int val):to(v),w(val) {}
16 };
17
18 int n,m;
19 const int maxn = 100007;
20 int vis[maxn];
21 int dist[maxn];
22 vector<node>g[maxn];
23
24 void init()
25 {
26
27     int a,b,c;
28     for(int i=0; i<=n; i++)g[i].clear();
29     for(int i=0; i<m; i++)
30     {
31         scanf("%d%d%d",&a,&b,&c);
32         g[a].push_back(node(b,c));
33     }
34     scanf("%d",&a);
35     for(int i=0; i<a; i++)
36     {
37         scanf("%d",&b);
38         g[0].push_back(node(b,0));
39     }
40     scanf("%d",&a);
41     for(int i=0; i<a; i++)
42     {
43         scanf("%d",&b);
44         g[b].push_back(node(n+1,0));
45     }
46 }
47
48 void dijkstra(int start)
49 {
50     priority_queue<P,vector<P>,greater<P> >que;
51     memset(dist,INF,sizeof(dist));
52     dist[start] = 0;
53     que.push(P(0,start));
54     while(!que.empty())
55     {
56         P p = que.top();
57         que.pop();
58         int v = p.second;
59         if(dist[v]<p.first)continue;
60         for(int i=0; i<g[v].size(); i++)
61         {
62             node e = g[v][i];
63             if(dist[e.to] > dist[v] + e.w)
64             {
65                 dist[e.to] = dist[v] + e.w;
66                 que.push(P(dist[e.to],e.to));
67             }
68         }
69     }
70 }
71
72 int main()
73 {
74     while(~scanf("%d%d",&n,&m))
75     {
76         init();
77         dijkstra(0);
78         printf("%d\n",dist[n+1]);
79     }
80     return 0;
81 }