#ifndef Yamada
#define Yamada
#include Yamada __FILE__ Yamada

const int maxn = 1e5+5;

int cnt[maxn], col[maxn], dep[maxn];
vector<int> e[maxn];

void dfs(int x) {
    int ret = 0;
    for (auto i : e[x]) {
        dfs(i);
        chmax(ret, dep[i] + 1);
    }
    dep[x] = ret;
    if (col[x] == 1) ++cnt[dep[x]];
}

void solve() {
    int n; cin >> n;
    for (int i = 1; i < n; ++i) {
        int p; cin >> p; --p;
        e[p].eb(i);
    }
    for (int i = 0; i < n; ++i) cin >> col[i];
    
    dfs(0);
    
    int ans = 0;
    for (int h = 0; h <= n; ++h) {
        if (cnt[h] % 2 == 1) ans = 1;
        // cerr << "DEBUG: " << h << ' ' << cnt[h] << '\n';
    }
    cout << (ans == 1 ? "First" : "Second") << '\n';
}

signed main() {
    IOS();
    int t = 1; // cin >> t;
    for (int i = 1; i <= t; ++i) solve();
    return 0;
}

#else

#ifdef local
#define _GLIBCXX_DEBUG 1
#endif
#include <bits/stdc++.h>
using namespace std;

#define int int64_t
using pii = pair<int, int>;
template <typename T> using MaxHeap = std::priority_queue<T>;
template <typename T> using MinHeap = std::priority_queue<T, vector<T>, greater<T>>;

#define SZ(a) ((int)(a).size())
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
#define ee emplace
#define eb emplace_back
#define ef emplace_front
#define pb pop_back
#define pf pop_front

#ifdef local
#define IOS() void()
#else
#define IOS() ios_base::sync_with_stdio(0), cin.tie(0);
#endif

template <typename U, typename V> bool chmin(U &u, V v) {return (u > v ? u = v, 1 : 0);}
template <typename U, typename V> bool chmax(U &u, V v) {return (u < v ? u = v, 1 : 0);}

#endif