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

class Fenwick {
	private:
		vector<ll> val;
	public:
		Fenwick(int n) : val(n+1, 0) {}

		// Adds v to index i
		void add(int i, ll v) {
			for (++i; i < val.size(); i += i & -i) {
				val[i] += v;
			}
		}

		// Calculates prefix sum up to index i
		ll get(int i) {
			ll res = 0;
			for (++i; i > 0; i -= i & -i) {
				res += val[i];
			}
			return res;
		}
		ll get(int a, int b) { return get(b) - get(a-1); }

		// Assuming prefix sums are non-decreasing, finds last i s.t. get(i) <= v
		int search(ll v) {
			int res = 0;
			for (int h = 1<<30; h; h >>= 1) {
				if ((res | h) < val.size() && val[res | h] <= v) {
					res |= h;
					v -= val[res];
				}
			}
			return res - 1;
		}
};

const ll MOD = (ll)1e9 + 7;
ll modPow(ll a, ll b) {
	if (b & 1) return modPow(a, b ^ 1) * a % MOD;
	if (b == 0) return 1;
	return modPow(a*a % MOD, b >> 1);
}

void dfs(int i, int& cur, vector<int>& le, vector<int>& ri, const vector<vector<int>>& g) {
	le[i] = cur;
	++cur;
	for (int t : g[i]) dfs(t, cur, le, ri, g);
	ri[i] = cur;
}

int calc(int i, vector<ll>& res, const vector<int>& cou, const vector<vector<int>>& g) {
	int siz = 1;
	for (int t : g[i]) {
		siz += calc(t, res, cou, g);
		res[i] = (res[i] + res[t]) % MOD;
	}
	res[i] = (res[i] + cou[i] * modPow(siz, MOD - 2)) % MOD;
	return siz;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int n, q;
	cin >> n >> q;
	
	int r = -1;
	vector<int> as(n), bs(n);
	vector<vector<int>> g(n);
	for (int i = 0; i < n; ++i) {
		int p;
		cin >> p;
		--p;
		if (p != -1) g[p].push_back(i);
		else r = i;
	}

	for (int i = 0; i < n; ++i) cin >> as[i];
	for (int i = 0; i < n; ++i) cin >> bs[i];
	
	int tmp = 0;
	vector<int> le(n), ri(n);
	dfs(r, tmp, le, ri, g);

	vector<pair<int, int>> evs(2*n);
	for (int i = 0; i < n; ++i) {
		evs[2*i] = {as[i], -(i + 1)};
		evs[2*i+1] = {as[i] + bs[i], (i + 1)};
	}
	sort(evs.begin(), evs.end());
	
	Fenwick fenw(n);
	vector<int> cou(n);
	for (auto pr : evs) {
		int i = abs(pr.second) - 1;
		if (pr.second < 0) fenw.add(le[i], 1);
		else cou[i] = fenw.get(le[i], ri[i] - 1);

		/*
		cerr << pr.first << ' ' << pr.second << ": ";
		if (pr.second < 0) cerr << "add to " << le[i] << '\n';
		else cerr << "get (" << le[i] << ' ' << ri[i] << "): " << fenw.get(le[i], ri[i] - 1) << '\n';
		*/
	}

	vector<ll> res(n, 0);
	calc(r, res, cou, g);

	for (int qi = 0; qi < q; ++qi) {
		int i;
		cin >> i;
		--i;
		cout << res[i] << '\n';
	}
}