#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

struct Hld {
  int n, rt;
  // needs to be tree
  // vertex lists
  // modified in build(rt) (parent removed, heavy child first)
  vector<vector<int>> graph;
  vector<int> sz, par, dep;
  int zeit;
  vector<int> dis, fin, sid;
  // head vertex (minimum depth) in heavy path
  vector<int> head;

  Hld() : n(0), rt(-1), zeit(0) {}
  explicit Hld(int n_) : n(n_), rt(-1), graph(n), zeit(0) {}
  void ae(int u, int v) {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    graph[u].push_back(v);
    graph[v].push_back(u);
  }

  void dfsSz(int u) {
    sz[u] = 1;
    for (const int v : graph[u]) {
      auto it = std::find(graph[v].begin(), graph[v].end(), u);
      if (it != graph[v].end()) graph[v].erase(it);
      par[v] = u;
      dep[v] = dep[u] + 1;
      dfsSz(v);
      sz[u] += sz[v];
    }
  }
  void dfsHld(int u) {
    dis[u] = zeit++;
    const int deg = graph[u].size();
    if (deg > 0) {
      int vm = graph[u][0];
      int jm = 0;
      for (int j = 1; j < deg; ++j) {
        const int v = graph[u][j];
        if (sz[vm] < sz[v]) {
          vm = v;
          jm = j;
        }
      }
      swap(graph[u][0], graph[u][jm]);
      head[vm] = head[u];
      dfsHld(vm);
      for (int j = 1; j < deg; ++j) {
        const int v = graph[u][j];
        head[v] = v;
        dfsHld(v);
      }
    }
    fin[u] = zeit;
  }
  void build(int rt_) {
    assert(0 <= rt_); assert(rt_ < n);
    rt = rt_;
    sz.assign(n, 0);
    par.assign(n, -1);
    dep.assign(n, -1);
    dep[rt] = 0;
    dfsSz(rt);
    zeit = 0;
    dis.assign(n, -1);
    fin.assign(n, -1);
    head.assign(n, -1);
    head[rt] = rt;
    dfsHld(rt);
    assert(zeit == n);
    sid.assign(n, -1);
    for (int u = 0; u < n; ++u) sid[dis[u]] = u;
  }

  friend ostream &operator<<(ostream &os, const Hld &hld) {
    const int maxDep = *max_element(hld.dep.begin(), hld.dep.end());
    vector<string> ss(2 * maxDep + 1);
    int pos = 0, maxPos = 0;
    for (int j = 0; j < hld.n; ++j) {
      const int u = hld.sid[j];
      const int d = hld.dep[u];
      if (hld.head[u] == u) {
        if (j != 0) {
          pos = maxPos + 1;
          ss[2 * d - 1].resize(pos, '-');
          ss[2 * d - 1] += '+';
        }
      } else {
        ss[2 * d - 1].resize(pos, ' ');
        ss[2 * d - 1] += '|';
      }
      ss[2 * d].resize(pos, ' ');
      ss[2 * d] += std::to_string(u);
      if (maxPos < static_cast<int>(ss[2 * d].size())) {
        maxPos = ss[2 * d].size();
      }
    }
    for (int d = 0; d <= 2 * maxDep; ++d) os << ss[d] << '\n';
    return os;
  }

  bool contains(int u, int v) const {
    return (dis[u] <= dis[v] && dis[v] < fin[u]);
  }
  int lca(int u, int v) const {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    for (; head[u] != head[v]; ) (dis[u] > dis[v]) ? (u = par[head[u]]) : (v = par[head[v]]);
    return (dis[u] > dis[v]) ? v : u;
  }
  int jumpUp(int u, int d) const {
    assert(0 <= u); assert(u < n);
    assert(d >= 0);
    if (dep[u] < d) return -1;
    const int tar = dep[u] - d;
    for (u = head[u]; ; u = head[par[u]]) {
      if (dep[u] <= tar) return sid[dis[u] + (tar - dep[u])];
    }
  }
  int jump(int u, int v, int d) const {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    assert(d >= 0);
    const int l = lca(u, v);
    const int du = dep[u] - dep[l], dv = dep[v] - dep[l];
    if (d <= du) {
      return jumpUp(u, d);
    } else if (d <= du + dv) {
      return jumpUp(v, du + dv - d);
    } else {
      return -1;
    }
  }
  // [u, v) or [u, v]
  template <class F> void doPathUp(int u, int v, bool inclusive, F f) const {
    assert(contains(v, u));
    for (; head[u] != head[v]; u = par[head[u]]) f(dis[head[u]], dis[u] + 1);
    if (inclusive) {
      f(dis[v], dis[u] + 1);
    } else {
      if (v != u) f(dis[v] + 1, dis[u] + 1);
    }
  }
  // not path order, include lca(u, v) or not
  template <class F> void doPath(int u, int v, bool inclusive, F f) const {
    const int l = lca(u, v);
    doPathUp(u, l, false, f);
    doPathUp(v, l, inclusive, f);
  }

  // (vs, ps): compressed tree
  // vs: DFS order (sorted by dis)
  // vs[ps[x]]: the parent of vs[x]
  // ids[vs[x]] = x, not set for non-tree vertex
  vector<int> ids;
  pair<vector<int>, vector<int>> compress(vector<int> us) {
    // O(n) first time
    ids.resize(n, -1);
    std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
      return (dis[u] < dis[v]);
    });
    us.erase(std::unique(us.begin(), us.end()), us.end());
    int usLen = us.size();
    assert(usLen >= 1);
    for (int x = 1; x < usLen; ++x) us.push_back(lca(us[x - 1], us[x]));
    std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
      return (dis[u] < dis[v]);
    });
    us.erase(std::unique(us.begin(), us.end()), us.end());
    usLen = us.size();
    for (int x = 0; x < usLen; ++x) ids[us[x]] = x;
    vector<int> ps(usLen, -1);
    for (int x = 1; x < usLen; ++x) ps[x] = ids[lca(us[x - 1], us[x])];
    return make_pair(us, ps);
  }
};

////////////////////////////////////////////////////////////////////////////////


struct Set {
  // max{ceil(log_64(n)), 1}
  int log64N, n;
  vector<unsigned long long> a[6];
  explicit Set(int n_ = 0) : n(n_) {
    assert(n >= 0);
    int m = n ? n : 1;
    for (int d = 0; ; ++d) {
      m = (m + 63) >> 6;
      a[d].assign(m, 0);
      if (m == 1) {
        log64N = d + 1;
        break;
      }
    }
  }
  bool empty() const {
    return !a[log64N - 1][0];
  }
  bool contains(int x) const {
    return (a[0][x >> 6] >> (x & 63)) & 1;
  }
  void insert(int x) {
    for (int d = 0; d < log64N; ++d) {
      const int q = x >> 6, r = x & 63;
      a[d][q] |= 1ULL << r;
      x = q;
    }
  }
  void erase(int x) {
    for (int d = 0; d < log64N; ++d) {
      const int q = x >> 6, r = x & 63;
      if ((a[d][q] &= ~(1ULL << r))) break;
      x = q;
    }
  }
  // max s.t. <= x (or -1)
  int prev(int x) const {
    if (x > n - 1) x = n - 1;
    for (int d = 0; d <= log64N; ++d) {
      if (x < 0) break;
      const int q = x >> 6, r = x & 63;
      const unsigned long long lower = a[d][q] << (63 - r);
      if (lower) {
        x -= __builtin_clzll(lower);
        for (int e = d; --e >= 0; ) x = x << 6 | (63 - __builtin_clzll(a[e][x]));
        return x;
      }
      x = q - 1;
    }
    return -1;
  }
  // min s.t. >= x (or n)
  int next(int x) const {
    if (x < 0) x = 0;
    for (int d = 0; d < log64N; ++d) {
      const int q = x >> 6, r = x & 63;
      if (static_cast<unsigned>(q) >= a[d].size()) break;
      const unsigned long long upper = a[d][q] >> r;
      if (upper) {
        x += __builtin_ctzll(upper);
        for (int e = d; --e >= 0; ) x = x << 6 | __builtin_ctzll(a[e][x]);
        return x;
      }
      x = q + 1;
    }
    return n;
  }
};


int N;
vector<int> P, C;
vector<int> W, A;

vector<Int> brute() {
  vector<string> S(N);
  for (int u = 1; u < N; ++u) {
    S[u] = S[P[u]] + "01"[C[u]];
  }
  vector<Int> ans(N, 0);
  for (int u = 0; u < N; ++u) {
    for (int d = 0; d <= (int)S[u].size(); ++d) {
      int mx = 0;
      for (int v = 0; v < N; ++v) {
        if (d >= A[v] &&
            S[u].size() <= S[v].size() &&
            S[u] == S[v].substr(S[v].size() - S[u].size()) &&
            S[u].substr(0, d) == S[v].substr(0, d)) {
          chmax(mx, W[v]);
        }
      }
      ans[u] += mx;
    }
  }
  return ans;
}

int nxt[500'010][2];
vector<int> fail;
void bfs() {
  fail.assign(N, 0);
  queue<int> que;
  que.push(0);
  for (; que.size(); ) {
    const int u = que.front();
    que.pop();
    for (int e = 0; e < 2; ++e) {
      int &v = nxt[u][e];
      if (~v) {
        fail[v] = u ? nxt[fail[u]][e] : 0;
        que.push(v);
      } else {
        v = u ? nxt[fail[u]][e] : 0;
      }
    }
  }
// cerr<<"fail = "<<fail<<endl;
}

Hld G, H;
vector<int> vs;

namespace slow {
vector<Int> ans;
vector<int> stack;
vector<int> ls;
void dfs(int u) {
  stack[G.dep[u]] = u;
  
  // ls[dis[v]] := dep[lca(u, v)]
  for (int d = 0; d < G.dep[u]; ++d) fill(ls.begin() + G.dis[stack[d]], ls.begin() + G.dis[stack[d + 1]], d);
  fill(ls.begin() + G.dis[u], ls.begin() + G.fin[u], G.dep[u]);
  for (int d = G.dep[u]; --d >= 0; ) fill(ls.begin() + G.fin[stack[d + 1]], ls.begin() + G.fin[stack[d]], d);
// for(int v=0;v<N;++v)assert(ls[G.dis[v]]==G.dep[G.lca(u,v)]);
  
  Set yet(G.dep[u] + 1);
  for (int d = 0; d <= G.dep[u]; ++d) yet.insert(d);
  for (const int v : vs) if (H.contains(u, v)) {
    const int dL = A[v];
    const int dR = ls[G.dis[v]];
    if (dL <= dR) {
      for (int d = dL; (d = yet.next(d)) <= dR; ) {
        ans[u] += W[v];
        yet.erase(d);
      }
    }
  }
  
  for (const int v : G.graph[u]) {
    dfs(v);
  }
  stack[G.dep[u]] = -1;
}
vector<Int> run() {
  ans.assign(N, 0);
  stack.assign(N, -1);
  ls.assign(N, -1);
  dfs(0);
  return ans;
}
}  // slow

namespace slow2 {
vector<Int> run() {
  vector<Int> ans(N, 0);
  for (int u = 0; u < N; ++u) {
    vector<int> mxs(G.dep[u] + 1, 0);
    for (int k = H.dis[u]; k < H.fin[u]; ++k) {
      const int v = H.sid[k];
      const int dL = A[v];
      const int dR = G.dep[G.lca(u, v)];
      for (int d = dL; d <= dR; ++d) {
        chmax(mxs[d], W[v]);
      }
    }
    for (int d = 0; d <= G.dep[u]; ++d) {
      ans[u] += mxs[d];
    }
  }
  return ans;
}
}  // slow2

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &N);
    P.assign(N, -1);
    C.assign(N, -1);
    for (int u = 1; u < N; ++u) {
      scanf("%d%d", &P[u], &C[u]);
      --P[u];
    }
    W.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%d", &W[u]);
    }
    A.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%d", &A[u]);
    }
    
    for (int u = 0; u < N; ++u) nxt[u][0] = nxt[u][1] = -1;
    for (int u = 1; u < N; ++u) nxt[P[u]][C[u]] = u;
    bfs();
    
    G = Hld(N);
    H = Hld(N);
    for (int u = 1; u < N; ++u) {
      G.ae(P[u], u);
      H.ae(fail[u], u);
    }
    G.build(0);
    H.build(0);
// cerr<<G<<H<<endl;
    
    vs.resize(N);
    for (int v = 0; v < N; ++v) vs[v] = v;
    sort(vs.begin(), vs.end(), [&](int v0, int v1) -> bool {
      return (W[v0] > W[v1]);
    });
    
    bool speB = true;
    for (int u = 1; u < N; ++u) speB = speB && (P[u] == (u + 1) / 2 - 1);
    
    vector<Int> ans;
    if (speB) {
      ans = slow2::run();
    } else {
      ans = slow::run();
    }
    for (int u = 0; u < N; ++u) {
      if (u) printf(" ");
      printf("%lld", ans[u]);
    }
    puts("");
#ifdef LOCAL
const auto brt=brute();
assert(brt==ans);
#endif
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}