#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
using namespace std;
const long long oo = 1000000000000000000;
long long int sum, ans = 0, mx = 0, mn = 1000000000, num, pos;
/*
ViHHiPuh
(( `'-""``""-'` ))
)-__-_.._-__-(
/ --- (o _ o) --- \
\ .-* ( .0. ) *-. /
_'-. ,_ '=' _, .-'_
/ `;#'#'# - #'#'#;` \
\_)) -----'#'----- ((_/
# --------- #
'# ------- ------ #'
/..-'# ------- #'-.\
_\...-\'# -- #'/-.../_
((____)- '#' -(____))
cout << fixed << setprecision(6) << x;
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
freopen ( "sum.in", "r", stdin )
*/
int d[ 100001 ];
queue <int> q;
vector <pair<int, int> > v[ 100001 ];
int main () {
int n, m;
cin >> n >> m;
int x, y, z;
for ( int i = 1; i <= m; i ++ ) {
cin >> x >> y >> z;
v[ x ].push_back( { y, z } );
v[ y ].push_back( { x, z } );
}
for ( int i = 1; i <= n; i ++ )
d[ i ] = mn;
int k;
cin >> k;
int a;
for ( int i = 1; i <= k; i ++ ) {
cin >> a;
q.push( a );
d[ a ] = 0;
}
while ( q.size() ) {
num = q.front();
q.pop();
for ( auto to : v[ num ] ) {
if ( d[ to.first ] > d[ num ] + to.second ) {
d[ to.first ] = d[ num ] + to.second;
q.push( to.first );
}
}
}
int q;
cin >> q;
int l, r;
while ( q -- ) {
cin >> l >> r;
cout << min( d[ l ], d[ r ] ) << "\n";
}
}
