N, M, tstart, db, E = map(int, input().split())
tstart -= 1
E -= 1
ns = [[] for _ in range(N)]
for _ in range(M):
    a, b, s = map(int, input().split())
    a -= 1
    b -= 1
    ns[a].append((b, s))
    ns[b].append((a, s))
treach = [1e6] * N
treach[tstart] = 0

op = {tstart}
cl = set()
steps = 1
while len(op) > 0:
    nextop = set()
    for n in op:
        for (ne, s) in ns[n]:
            if s == 2 and ne not in cl and ne not in op:
                nextop.add(ne)
                treach[ne] = steps
    cl = cl.union(op)
    op = nextop
    steps += 1


def doit(jstart):
    op = {jstart}
    cl = set()
    obs = set()
    while len(op) > 0:
        newop = set()
        for n in op:
            for (ne, _) in ns[n]:
                if ne in op or ne in cl:
                    continue
                if ne == E:
                    return 0
                if treach[ne] > steps:
                    newop.add(ne)
                else:
                    obs.add(ne)
        cl = cl.union(op)
        op = newop
        if len(obs) >= 2:
            op = op.union(obs)
            obs = set()
    return next(iter(obs)) + 1


jstarts = [int(x) - 1 for x in input().split()]
steps = 1
for jstart in jstarts:
    print(doit(jstart))