#define _GLIBCXX_FILESYSTEM
#include <bits/stdc++.h>
#define ll long long
#define int ll
using namespace std;

int n;

int dfs(int strt, vector<vector<int>>& v, int mincost[], int cost[]) {
    if (mincost[strt] == -1) {
        int sum = 0;

        for (int i = 0; i < v[strt].size(); i++) {
            sum += 1ll * dfs(v[strt][i], v, mincost, cost);
        }
        mincost[strt] = min((ll)sum, (ll)cost[strt]);
        return mincost[strt];
    } else
        return mincost[strt];
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int t;
    cin >> t;
    while (t--) {
        int k;
        cin >> n >> k;
        int cost[n];
        for (int i = 0; i < n; i++)
            cin >> cost[i];
        int e;
        int mincost[n];
        for (int i = 0; i < n; i++)
            mincost[i] = -1;
        for (int i = 0; i < k; i++) {
            cin >> e;
            mincost[e - 1] = 0;
        }
        vector<vector<int>> v;
        vector<int> g;
        for (int i = 0; i < n; i++) {
            int m;
            cin >> m;
            if (m == 0) {
                if (mincost[i] == -1) {
                    g.push_back(0);
                    v.push_back(g);
                    g.clear();
                    mincost[i] = cost[i];
                    continue;
                }
            }
            for (int j = 0; j < m; j++) {
                int x;
                cin >> x;
                g.push_back(x - 1);
            }
            if (mincost[i] != 0)
                v.push_back(g);
            else {
                g.clear();
                g.push_back(0);
                v.push_back(g);
            }
            g.clear();
        }

        for (int i = 0; i < n; i++) {
            if (mincost[i] == -1) {
                dfs(i, v, mincost, cost);
            }
        }

        for (int i = 0; i < n; i++)
            cout << mincost[i] << ' ';
        cout << endl;
    }

    return 0;
}