/// Brrrr Brrrr
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

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

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x,y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 1e6+5, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-7;

const int dx[] = {0,0,1,-1};
const int dy[] = {1,-1,0,0};

int n, c[N], mx[N];
vector<int> adj[N];
map<int,int> mp;
void dfs(int node) {
    for(auto v : adj[node]) {
        dfs(v);
        mx[node] = max(mx[v]+1,mx[node]);
    }
    if(c[node])mp[mx[node]] ^= 1;
}
void doWork() {

    cin >> n;
    f(i,2,n+1) {
        int p;
        cin >> p;
        adj[p].pb(i);
    }
    for(int i = 1; i <= n; i++)
        cin >> c[i];

    dfs(1);
    for(auto it : mp) {
        if(it.S) {
            cout << "First\n";
            return;
        }
    }

    cout << "Second\n";

}
int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE


    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}

///Look at my code ya codeomk