#include<bits/stdc++.h>
#define pb push_back
#define pf push_front
#define F first
#define S second
#define ff first
#define ss second
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<ll,ll>
#define plll pair<ll,pll>
#define pllll pair<pll,pll>
#define vl vector<ll>
#define vll vector<pll>
#define vlll vector<plll>
#define vllll vector<pllll>
#define vb vector<bool>
#define sz size()
#define fr front()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bk back();
using namespace std;
const ld pi=3.14159265359;
const ll e5=1e5;
const ll e6=1e6;
const ll e9=1e9;
const ll inf=1e18;
const ll mod=1e9+7;
const ll mod2=998244353;
const ll N=1e5+5;
ll bpm(ll x,ll y,ll m){if(y==0)return 1%m;if(y==1)return x%m;ll p=bpm(x,y/2,m);
if(y%2==0)return p*p%m;else return p*p%m*x%m;}
ll bp(ll x,ll y){if(y==0)return 1;if(y==1)return x;ll p=bp(x,y/2);
if(y%2==0)return p*p;else return p*p*x;}
struct query{
ll a,b,i;
};
vll g[N];
pll pd[N];
ll d[N],p[N],siz[N],ans[N];
vector<query> v;
ll get(ll x){
if(x!=p[x]) p[x]=get(p[x]);
return p[x];
}
void uni(ll a,ll b){
a=get(a), b=get(b);
if(a==b) return;
if(siz[a]<siz[b]) swap(a,b);
siz[a]+=siz[b];
p[b]=a;
}
void solve(){
ll n,m,k,q;
cin>>n>>m;
map<pll,bool> mp;
for(ll i=1;i<=n;i++) d[i]=inf, p[i]=i, siz[i]=1;
for(ll i=1;i<=m;i++){
ll a,b,w; cin>>a>>b>>w;
g[a].pb({b,w});
g[b].pb({a,w});
mp[{a,b}]=mp[{b,a}]=1;
}
cin>>k;
queue<pll> qu;
for(ll i=1;i<=k;i++){
ll x; cin>>x;
qu.push({x,0});
}
while(!qu.empty()){
ll v=qu.fr.F, s=qu.fr.S;
qu.pop();
if(d[v]<=s) continue;
d[v]=s;
for(auto [to,w]:g[v]){
if(d[to]>s+w) qu.push({to,s+w});
}
}
cin>>q;
for(ll i=1;i<=q;i++){
ll a,b; cin>>a>>b;
if(mp[{a,b}]) ans[i]=min(d[a],d[b]);
else v.pb({a,b,i});
}
for(ll i=1;i<=n;i++) pd[i]={d[i],i};
sort(pd+1,pd+n+1);
reverse(pd+1,pd+n+1);
for(ll i=1;i<=n;i++){
for(auto [to,w]:g[pd[i].S]){
if(d[to]>=pd[i].F) uni(pd[i].S,to);
}
for(ll j=0;j<v.sz;j++){
if(v[j].i!=0&&get(v[j].a)==get(v[j].b)){
ans[v[j].i]=pd[i].F;
v[j].i=0;
}
}
}
for(ll i=1;i<=q;i++) cout<<ans[i]<<'\n';
return;
}
int main(/*Aldk*/){
ios_base::sync_with_stdio(false);cin.tie(NULL);
//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);
//cout<<setprecision(6)<<fixed;
ll T=1;
//cin>>T;
for(ll i=1;i<=T;i++){
//cout<<"Case "<<i<<": ";
solve();
//cout<<'\n';
}
return 0;
}
