mod util {
    pub trait Join {
        fn join(self, sep: &str) -> String;
    }

    impl<T, I> Join for I
    where
        I: Iterator<Item = T>,
        T: std::fmt::Display,
    {
        fn join(self, sep: &str) -> String {
            let mut s = String::new();
            use std::fmt::*;
            for (i, v) in self.enumerate() {
                if i > 0 {
                    write!(&mut s, "{}", sep).ok();
                }
                write!(&mut s, "{}", v).ok();
            }
            s
        }
    }
}
// ---------- begin recurse ----------
// reference
// https://twitter.com/noshi91/status/1393952665566994434
// https://twitter.com/shino16_cp/status/1393933468082397190
pub fn recurse<A, R, F>(f: F) -> impl Fn(A) -> R
where
    F: Fn(&dyn Fn(A) -> R, A) -> R,
{
    fn call<A, R, F>(f: &F, a: A) -> R
    where
        F: Fn(&dyn Fn(A) -> R, A) -> R,
    {
        f(&|a| call(f, a), a)
    }
    move |a| call(&f, a)
}
// ---------- end recurse ----------
// ---------- begin scannner ----------
#[allow(dead_code)]
mod scanner {
    use std::str::FromStr;
    pub struct Scanner<'a> {
        it: std::str::SplitWhitespace<'a>,
    }
    impl<'a> Scanner<'a> {
        pub fn new(s: &'a String) -> Scanner<'a> {
            Scanner {
                it: s.split_whitespace(),
            }
        }
        pub fn next<T: FromStr>(&mut self) -> T {
            self.it.next().unwrap().parse::<T>().ok().unwrap()
        }
        pub fn next_bytes(&mut self) -> Vec<u8> {
            self.it.next().unwrap().bytes().collect()
        }
        pub fn next_chars(&mut self) -> Vec<char> {
            self.it.next().unwrap().chars().collect()
        }
        pub fn next_vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
            (0..len).map(|_| self.next()).collect()
        }
    }
}
// ---------- end scannner ----------

use std::collections::*;
use std::io::Write;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    use std::io::Read;
    let mut s = String::new();
    std::io::stdin().read_to_string(&mut s).unwrap();
    let mut sc = scanner::Scanner::new(&s);
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    run(&mut sc, &mut out);
}

fn run<W: Write>(sc: &mut scanner::Scanner, out: &mut std::io::BufWriter<W>) {
    let t: u32 = sc.next();
    for _ in 0..t {
        let n: usize = sc.next();
        let s = sc.next_bytes();
        let mut child = vec![vec![]; n];
        for i in 1..n {
            let p = sc.next::<usize>() - 1;
            child[p].push(i);
        }
        let ans = std::cell::RefCell::new(vec![0i32; n]);
        recurse(|rec, v: usize| -> (i32, Vec<i32>) {
            if child[v].is_empty() {
                let score = 0;
                let mut d = vec![];
                if s[v] == b'1' {
                    d.push(-1);
                } else {
                    d.push(1);
                }
                return (score, d);
            }
            let mut c = vec![];
            for &u in child[v].iter() {
                c.push(rec(u));
            }
            if c.len() <= 1 {
                let (score, mut d) = c.pop().unwrap();
                ans.borrow_mut()[v] = score;
                if s[v] == b'1' {
                    d.push(-1);
                } else {
                    d.push(1);
                }
                return (score, d);
            }
            let len = c.iter().map(|p| p.1.len()).min().unwrap();
            let mut table = vec![0; len + 1];
            for (s, mut d) in c {
                d.sort();
                let pos = d.iter().position(|d| *d >= 0).unwrap_or(d.len());
                let mut val = vec![s; d.len() + 1];
                for i in pos..d.len() {
                    val[i + 1] = val[i] + d[i];
                }
                for i in (0..pos).rev() {
                    val[i] = val[i + 1] - d[i];
                }
                for (table, val) in table.iter_mut().zip(val.iter()) {
                    *table += *val;
                }
            }
            let score = *table.iter().min().unwrap();
            let mut diff = table.windows(2).map(|t| t[1] - t[0]).collect::<Vec<_>>();
            ans.borrow_mut()[v] = score;
            if s[v] == b'1' {
                diff.push(-1);
            } else {
                diff.push(1);
            }
            (score, diff)
        })(0);
        use util::*;
        writeln!(out, "{}", ans.borrow().iter().join(" ")).ok();
    }
}