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

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

int dfs(int v) {
    int i = v;
    for (int x : g[v]) {
        int j = dfs(x);
        dp[v] = max(dp[v], dp[x] + 1);

        if (st[i].size() < st[j].size()) {
            swap(i, j);
        }
        for (int x : st[j]) {
            if (col[v]) {
                while (st[i].find(x) != st[i].end()) {
                    st[i].erase(x);
                    x = x + 1;
                }
                st[i].insert(x);
            }
            else {
                if (st[i].find(x) != st[i].end()) {
                    st[i].erase(x);
                }
                else st[i].insert(x);
            }
        }
    }
    if (col[v]) {
        int x = dp[v];
        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);
    cout << (!st[i].empty() ? "First" : "Second");
}