Computational complexity of several problems related to the L(p,q)-labeling problem of trees are resolved.