#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define sz(x) signed(size(x))

inline void solve() {
        int n;
        cin >> n;

        vector<vector<int>> adj(n);
        for (int i = 1; i < n; i++) {
                int x;
                cin >> x;
                x--;
                adj[x].push_back(i);
                adj[i].push_back(x);
        }

        vector<int> col(n);
        for (int i = 0; i < n; i++) cin >> col[i];

        vector<int> h(n);
        vector<int> lv(n, 1);
        auto dfs = [&](auto dfs, int x, int lst) -> void {
                for (auto y : adj[x]) {
                        if (y == lst) continue;
                        dfs(dfs, y, x);
                        lv[x] = max(lv[x], lv[y] + 1);
                }
                if(col[x]) h[lv[x]]++;
        };
        dfs(dfs, 0, -1);
        for (int i = 0; i < n; i++) {
                if (h[i] & 1) {
                        cout << "First\n";
                        return;
                }
        }
        cout << "Second\n";
        return;
}

signed main() {
        cin.tie(0)->sync_with_stdio(0);
        int t = 1;
        while (t--)
                solve();
        return 0;
}