#include <bits/stdc++.h>
using namespace std;

using i64 = long long;
using pii = pair<int, int>;
using pli = pair<i64, int>;
const int N = 1e5 + 10;

int n;
vector<pii> g[N];

i64 danger[N];

int fa[18][N], dep[N], dsu[N];

int find(int u) {return dsu[u] == u ? u : dsu[u] = find(dsu[u]);}

int lca(int u, int v) {
    if(dep[u] < dep[v]) swap(u, v);
    for(int j = 17; j >= 0; j --)
        if(dep[fa[j][u]] >= dep[v])
            u = fa[j][u];
    if(u == v) return u;
    for(int j = 17; j >= 0; j --)
        if(fa[j][u] != fa[j][v]) {
            u = fa[j][u];
            v = fa[j][v];
        }
    return fa[0][u];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int m;
    cin >> n >> m;
    for(int i = 1, a, b, w; i <= m; i ++) {
        cin >> a >> b >> w;
        g[a].emplace_back(b, w);
        g[b].emplace_back(a, w);
    }

    fill(danger + 1, danger + n + 1, INT_MAX);
    priority_queue<pli, vector<pli>, greater<pli> > q;
    int k;
    cin >> k;
    for(int i = 0, u; i < k; i ++) {
        cin >> u;
        danger[u] = 0;
        q.push({0, u});
    }

    while(q.size()) {
        auto [x, u] = q.top();
        q.pop();

        if(x > danger[u]) continue;

        for(auto &[v, w] : g[u]) {
            if(x + w < danger[v]) {
                danger[v] = x + w;
                q.push({x + w, v});
            }
        }
    }

    vector<int> id(n);
    iota(id.begin(), id.end(), 1);
    sort(id.begin(), id.end(), [](int a, int b) {return danger[a] > danger[b];});

    for(int i : id) {
        dsu[i] = i;
        for(auto [v, w] : g[i]) {
            if(!dsu[v]) continue;
            v = find(v);
            if(v != i) {
                fa[0][v] = i;
                dsu[v] = i;
            }
        }
    }

    reverse(id.begin(), id.end());
    for(int i : id)
        dep[i] = dep[fa[0][i]] + 1;
    
    for(int i = 0; i + 1 < 18; i ++)
        for(int j = 1; j <= n; j ++)
            fa[i + 1][j] = fa[i][fa[i][j]];
    
    {
        int q, u, v;
        cin >> q;
        while(q --) {
            cin >> u >> v;
            cout << danger[lca(u, v)] << "\n";
        }
    }
}