Submission #287479

---

Source Code Expand

n,x = map(int,raw_input().split())
takara = map(int,raw_input().split())
g=[]
for i in xrange(n-1):
    g.append(map(int,raw_input().split()))

# print g

def dfs(now):

    s=0

    tg=g[:]
    for e in tg:
        if e[0]==now:
            g.remove(e)
            s+=dfs(e[1])


    tg=g[:]
    for e in tg:
        if e[1]==now:
            g.remove(e)
            s+=dfs(e[0])

    if (s>0 or takara[now-1]==1) and now!=x:
        s+=1


    return s

print dfs(x)*2
# print g

Submission Info

Judge Result