//start of jonathanirvings' template v3.0.3 (BETA)

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

typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};

#ifdef TESTING
  #define DEBUG fprintf(stderr,"====TESTING====\n")
  #define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
  #define debug(...) fprintf(stderr, __VA_ARGS__)
#else
  #define DEBUG 
  #define VALUE(x)
  #define debug(...)
#endif

#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define REP(i,n) FOR(i,0,n)
#define REPN(i,n) FORN(i,1,n)
#define MAX(a,b) a = max(a,b)
#define MIN(a,b) a = min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define RESET(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)

inline string IntToString(LL a){
  char x[100];
  sprintf(x,"%lld",a); string s = x;
  return s;
}

inline LL StringToInt(string a){
  char x[100]; LL res;
  strcpy(x,a.c_str()); sscanf(x,"%lld",&res);
  return res;
}

inline string GetString(void){
  char x[1000005];
  scanf("%s",x); string s = x;
  return s;
}

inline string uppercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}

inline string lowercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}

inline void OPEN (string s) {
  #ifndef TESTING
  freopen ((s + ".in").c_str (), "r", stdin);
  freopen ((s + ".out").c_str (), "w", stdout);
  #endif
}

//end of jonathanirvings' template v3.0.3 (BETA)

int dp[1005];
int n;
vi child[1005];
int parent[1005];
int x[1005];

int jahja(int now)
{
  int &ret = dp[now];
  if (ret >= 0) return ret;
  vector<vector<int>> ddp(2, vector<int>(x[now] + 1, 0));
  // REP(i,SIZE(child[now]))
  FORD(i,SIZE(child[now])-1,0)
  {
    int a = x[child[now][i]];
    int b = jahja(child[now][i]);
    int ii = i % 2;
    FORD(j,x[now],0)
    {
      ddp[ii][j] = INF;
      if (j >= a) MIN(ddp[ii][j],ddp[1-ii][j - a] + b);
      if (j >= b) MIN(ddp[ii][j],ddp[1-ii][j - b] + a);
      // if (now == 2) printf("%d, ",ddp[ii][j]);
      // if (now == 2) printf("%d ",ddp[1-ii][j]);
      // if (now == 2) debug(">>>%d %d\n",a,b);
    }
    // if (now == 2) puts("");
    // VALUE(now);
  }
  ret = INF;
  FORN(j,0,x[now]) MIN(ret,ddp[0][j]);
  // printf("%d %d\n",now,ret);
  return ret;
}

int main()
{
  scanf("%d",&n);
  FOR(i,1,n)
  {
    scanf("%d",&parent[i]);
    --parent[i];
    child[parent[i]].pb(i);
  }
  REP(i,n) scanf("%d",&x[i]);
  RESET(dp,-1);
  int risan = jahja(0);
  puts(risan >= INF ? "IMPOSSIBLE" : "POSSIBLE");
  return 0;
}










Measured memory_bytes: 11272