#include <bits/stdc++.h>  // {{{

// https://codeforces.com/blog/entry/96344

#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;

template <typename T>
[[nodiscard]] static T MIN() {
  return std::numeric_limits<T>::min();
}

template <typename T>
[[nodiscard]] static T MAX() {
  return std::numeric_limits<T>::max();
}

template <typename T>
[[nodiscard]] static T sc(auto&& x) {
  return static_cast<T>(x);
}

template <typename T>
[[nodiscard]] static T sz(auto&& x) {
  return static_cast<T>(x.size());
}

#define prln(...) std::println(__VA_ARGS__)
#define pr(...) std::print(__VA_ARGS__)

#ifdef LOCAL
#define dbgln(...) std::println(__VA_ARGS__)
#define dbg(...) std::print(__VA_ARGS__)
#endif

inline static void NO() {
  prln("NO");
}

inline static void YES() {
  prln("YES");
}

using ll = long long;
using ld = long double;
template <typename T>
using ve = std::vector<T>;
template <typename T, size_t N>
using ar = std::array<T, N>;
template <typename T1, typename T2>
using pa = std::pair<T1, T2>;
template <typename... Ts>
using tu = std::tuple<Ts...>;
template <typename... Ts>
using dq = std::deque<Ts...>;
template <typename... Ts>
using qu = std::queue<Ts...>;
template <typename... Ts>
using pq = std::priority_queue<Ts...>;
template <typename... Ts>
using st = std::stack<Ts...>;
auto lb = [](auto... args) {
  return std::lower_bound(args...);
};
auto ub = [](auto... args) {
  return std::upper_bound(args...);
};

#define ff first
#define ss second
#define eb emplace_back
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
//  }}}

bitset<2 * 100000 + 1> seen;

void solve() {
  int n, k;
  cin >> n >> k;
  seen.reset();
  ve<ll> c(n + 1);
  for (int i = 1; i <= n; ++i) {
    cin >> c[i];
  }
  int p;
  for (int i = 1; i <= k; ++i) {
    cin >> p;
    c[p] = 0;
    seen[p] = true;
  }
  int m;
  ve<ve<ll>> recipes(n + 1);
  for (int i = 1; i <= n; ++i) {
    cin >> m;
    recipes[i].resize(m);
    for (int j = 0; j < m; ++j) {
      cin >> recipes[i][j];
    }
  }

  int x = 3;

  auto dfs = [&](auto&& self, int u) {
    if (seen[u] || recipes[u].empty())
      return c[u];
    seen[u] = true;
    ll total = 0;
    for (auto& v : recipes[u])
      total += self(self, v);
    c[u] = min(c[u], total);
    return c[u];
  };

  for (int i = 1; i <= n; ++i) {
    pr("{} ", dfs(dfs, i));
  }
  prln();
}

int main() {  // {{{
  cin.tie(nullptr)->sync_with_stdio(false);
  cin.exceptions(cin.failbit);

  int t = 1;
  cin >> t;

  while (t--) {
    solve();
  }

  return 0;
}
// }}}