Before revision:  In particular, given a temporal graph and a set of source vertices, we find the set of vertices that are reachable from a source via a time-respecting path, and such that the  difference in timestamps between consecutive edges is at most a resting time.
After revision:  In particular, given a temporal graph and a set of source vertices, we find the set of vertices that are reachable from a source via a time-respecting path, and such that the vertex colors of the path agree with the multiset query and the difference in timestamps between consecutive edges is at most a resting time.