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

const int N = 101010;
int n, col[N], dep[N], cnt[N];
vector<int> g[N];
set<int> st[N];

int dfs(int v, int t) {
    int i = v;
    if (col[v]) st[i].insert(dep[v]);
    for (int x : g[v]) {
        dep[x] = dep[v] + 1;
        int j = dfs(x, t | col[v]);
        if (st[i].size() < st[j].size()) {
            swap(i, j);
        }
        for (int x : st[j]) {
            if (t == 0) {
                if (st[i].find(x) == st[i].end()) {
                    st[i].insert(x);
                }
                else st[i].erase(x);
            }
            else {
                while (st[i].find(x) != st[i].end()) {
                    st[i].erase(x);
                    x = x - 1;
                }
                st[i].insert(x);
            }
        }
    }
    return i;
}


int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    cin >> n;
    for (int i = 2; i <= n; i++) {
        int x; cin >> x;
        g[x].push_back(i);
    }
    for (int i = 1; i <= n; i++) {
        cin >> col[i];
    }
    int i = dfs(1, 0);
    cout << (!st[i].empty() ? "First" : "Second");
}