Reconstructing the number of blocks of an infinite graph

It is shown that two hypomorphic infinite graphs always have the same number of blocks. This settles a problem of Nash-Williams (C.St.J.A. Nash-Williams, Reconstruction of infinite graphs, Discrete Mathematics 95 (1991) 221-229).