import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.stream.Stream;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.Comparator;
import java.util.Collections;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        CompanyClubHiearchies solver = new CompanyClubHiearchies();
        int testCount = Integer.parseInt(in.next());
        for (int i = 1; i <= testCount; i++)
            solver.solve(i, in, out);
        out.close();
    }

    static class CompanyClubHiearchies {
        public int mod = 1000000007;

        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int n = in.nextInt(), q = in.nextInt();
            int[] par = new int[n];
            List<Integer>[] child = LUtils.genArrayList(n);
            int[] size = new int[n];
            for (int i = 1; i < n; i++) {
                par[i] = in.nextInt();
                child[par[i]].add(i);
            }
            for (int i = n - 1; i >= 0; i--) {
                ++size[i];
                for (int j : child[i]) size[i] += size[j];
            }
            for (int i = n - 1; i >= 0; i--) {
                Collections.sort(child[i], Comparator.comparingInt(x -> -size[x]));
            }
            int[] c = in.readIntArray(n);
            int[] k = in.readIntArray(n);
            HashMap<Long, Integer>[] mp = Stream.generate(HashMap::new).limit(n).toArray(HashMap[]::new);
            int[] ans = new int[n];
            for (int i = n - 1; i >= 0; i--) {
                if (child[i].size() > 0) {
                    final int ii = i;
                    mp[i] = mp[child[i].get(0)];
                    for (int j = 1; j < child[i].size(); j++) {
                        mp[child[i].get(j)].forEach((key, value) ->
                                mp[ii].merge(key, value, (x, y) -> x + y >= mod ? x + y - mod : x + y)
                        );
                    }
                }
                ans[i] = k[i] == 0 ? 1 : mp[i].getOrDefault(1L * c[i] * (q + 1) + k[i] - 1, 0);
                mp[i].merge(1L * c[i] * (q + 1) + k[i], ans[i], (x, y) -> x + y >= mod ? x + y - mod : x + y);
            }
            for (int i = 0; i < n; i++) {
                out.println(ans[i]);
            }
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int[] readIntArray(int tokens) {
            int[] ret = new int[tokens];
            for (int i = 0; i < tokens; i++) {
                ret[i] = nextInt();
            }
            return ret;
        }

        public int read() {
            if (this.numChars == -1) {
                throw new InputMismatchException();
            } else {
                if (this.curChar >= this.numChars) {
                    this.curChar = 0;

                    try {
                        this.numChars = this.stream.read(this.buf);
                    } catch (IOException var2) {
                        throw new InputMismatchException();
                    }

                    if (this.numChars <= 0) {
                        return -1;
                    }
                }

                return this.buf[this.curChar++];
            }
        }

        public int nextInt() {
            int c;
            for (c = this.read(); isSpaceChar(c); c = this.read()) {
                ;
            }

            byte sgn = 1;
            if (c == 45) {
                sgn = -1;
                c = this.read();
            }

            int res = 0;

            while (c >= 48 && c <= 57) {
                res *= 10;
                res += c - 48;
                c = this.read();
                if (isSpaceChar(c)) {
                    return res * sgn;
                }
            }

            throw new InputMismatchException();
        }

        public String next() {
            int c;
            while (isSpaceChar(c = this.read())) {
                ;
            }

            StringBuilder result = new StringBuilder();
            result.appendCodePoint(c);

            while (!isSpaceChar(c = this.read())) {
                result.appendCodePoint(c);
            }

            return result.toString();
        }

        public static boolean isSpaceChar(int c) {
            return c == 32 || c == 10 || c == 13 || c == 9 || c == -1;
        }

    }

    static class LUtils {
        public static <E> List<E>[] genArrayList(int size) {
            return Stream.generate(ArrayList::new).limit(size).toArray(List[]::new);
        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void close() {
            writer.close();
        }

        public void println(int i) {
            writer.println(i);
        }

    }
}