#include <bits/stdc++.h>
#include <random>
using namespace std;

#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
const int MOD = 1e9 + 7;
const int INF = INT_MAX / 2;
struct edge { int i, v; };

void dfs(int u, vector<vector<int> >& G, vector<int>& a, vector<int>& b) {
	int M = a[u];
	vector<int> dp(M + 1, INF);
	dp[0] = 0;
	for (int v: G[u]) {
		dfs(v, G, a, b);
		vector<int> _dp(M + 1, INF);
		for (int x = 0; x + a[v] <= M; x++)
			_dp[x + a[v]] = min(_dp[x + a[v]], dp[x] + b[v]);
		for (int x = 0; x + b[v] <= M; x++)
			_dp[x + b[v]] = min(_dp[x + b[v]], dp[x] + a[v]);
		dp = _dp;
	}
	b[u] = INF;
	rep(x, M + 1) b[u] = min(b[u], dp[x]);
}

int main() {
	int N; cin >> N;
	vector<vector<int> > G(N);
	for (int u = 1; u < N; u++) {
		int p; cin >> p; p--;
		G[p].pb(u);
	}
	vector<int> a(N);
	rep(u, N) cin >> a[u];
	vector<int> b(N);
	dfs(0, G, a, b);
	cout << (b[0] < INF ? "POSSIBLE" : "IMPOSSIBLE") << endl;
}
