#include <bits/stdc++.h>

using namespace std;
vector<int> a, sz;
map<int, vector<int>> th;
int ans = 0;

void dfs(int u, int p = -1) {
    int cool = 0;
    int tot1 = 0, tot2 = 0;
    for (auto v: th[u]) {
        if (v == p)continue;
        dfs(v, u);
        if (a[v] > tot1) {
            tot2 = tot1;
            tot1 = a[v];
        } else {
            tot2 = max(tot2, a[v]);
        }
        cool = max(cool, a[v]);
    }
    int tot = tot1 + tot2;
    ans = max(ans, a[u] + tot);
    a[u] = a[u] + cool;

}

signed main() {
    int n;
    ans = INT_MIN;
    cin >> n;
    a = sz = vector<int>(n + 33, 0);
    for (int i = 2; i <= n; i++) {
        int u;
        cin >> u;
        th[u].push_back(i);
        th[i].push_back(u);
    }
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    dfs(1);
    cout << (ans % 2 and ans != INT_MIN ? "First" : "Second") << "\n";
}