#include<iostream>
#include<cstring>
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;

typedef struct navi {
    int u, d;
} point;

const int INF = 987654321;
int t, n, m, q, vi, ui, di, b;
int distant[10000], prevnode[10000], shortest[10000];
double probability[10000], remainprob[10000], superpass[10000];
bool isinS[10000];
map<pair<int, int>, int> edge;

bool compareObj(const point& a, const point& c) {
    return (a.d < c.d) || (a.d == c.d && a.u < c.u);
}

int main() {
    //freopen("input.txt", "r", stdin);
    scanf("%d", &t);
    while(t--) {
        // input
        scanf("%d%d", &n, &m);
        edge.clear();
        for (int i=0; i<m; i++) {
            scanf("%d%d%d", &vi, &ui, &di);
            edge[pair<int, int>(ui-1, vi-1)] = edge[pair<int, int>(vi-1, ui-1)] = di;
        }

        // dijkstra's algorithm
        for (int i=0; i<n; i++)
            distant[i] = INF;
        memset(isinS, 0, sizeof(isinS));
        memset(prevnode, -1, sizeof(prevnode));
        distant[n-1] = 0;
        for(int j=0; j<n; j++) {
            int u = -1, d = INF;
            for (int i=0; i<n; i++) {
                if (!isinS[i] && (distant[i] < d)) {
                    u = i; d = distant[i];
                }
            }
            if (!~u) break;
            shortest[j] = u;
            isinS[u] = true;
            for (int i=0; i<n; i++) {
                map<pair<int, int>, int>::iterator it = edge.find(pair<int, int>(u, i));
                if (it != edge.end() && (distant[i] > distant[u] + it->second || (distant[i] == distant[u] + it->second && prevnode[i] > u))) {
                    distant[i] = distant[u] + it->second;
                    prevnode[i] = u;
                }
            }
        }

        // spread probability
        bool start = false;
        probability[0] = 1;
        for (int i=1; i<n; i++)
            probability[i] = 0;
        for (int i=n-1; i>=0; i--) {
            if (shortest[i] == 0)
                start = true;
            if (!start)
                continue;
            int u = shortest[i];
            double comsat = 1;
            point city[10001];
            int citynum = 0;
            for (int j=0; j<n; j++) {
                map<pair<int, int>, int>::iterator it = edge.find(pair<int, int>(u, j));
                if (it != edge.end() && (distant[j] < distant[u])) {
                    city[citynum].u = j; city[citynum].d = it->second; citynum++;
                }
            }
            sort(city, city+citynum, compareObj);
            for (int j=0; j<citynum; j++) {
                comsat /= 2;
                probability[city[j].u] += comsat * probability[u];
            }
            superpass[u] = comsat;
        }

        // calculate remaining probability
        for (int i=0; i<n; i++)
            remainprob[i] = 0;
        for (int i=0; i<n-1; i++) {
            int temp = i;
            while(temp < n-1) {
                temp = prevnode[temp];
                remainprob[temp] += superpass[i] * probability[i];
            }
        }
        for (int i=0; i<n; i++)
            probability[i] += remainprob[i];

        //output
        scanf("%d", &q);
        while(q--) {
            scanf("%d", &b);
            printf("%.8f ", probability[b-1]);
        }
        printf("\n");
    }

    return 0;
}