For trees, there may well be a "scoring scheme" associated with your trees already i.e....
if you used maximum likelihood (ML) to estimate the "best" phylogeny to explain your data, then this would be the likelihood score for the tree (as you might expect, ML methods propose the most likely tree [the tree that makes the observed data, i.e. the multiple sequence alignment used to estimate the tree, most probable] as the "best" tree)
If you used maximum parsimony, this would be the parsimony score for the tree etc.
However, I guess that rather than asking "what is the best tree?" you're more interested in asking "which set of trees are not 'significantly' worse than my best tree?" (which is what Whetting, in the answer above, is helping you with).
As Whetting indicates, there are tests out there that allow you to do this kind of thing: ILD (I think only applicable in a parsimony framework...?), SH, and others.
These tests need to be used with considerable caution, though! This article, written by a bunch of phylogeneticists who understand the issues far better than I do, describe some of the issues:
Likelihood-based tests of topologies in phylogenetics. 2000. Syst Biol 49(4):652-670. Goldman, N, Anderson, JP, and Rodrigo, AG
http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?cmd=Retrieve&db=PubMed&dopt=Citation&list_uids=12116432
One important message to come from this is "in almost all cases do not use the Kishino-Hasegawa (KH) test!" which was one of the first tests of this kind to be described; the test itself is not "bad" but the specific question being addressed by the test is very very rarely the question the user wants to ask, leading to the results of the test being very commonly badly misinterpreted.
This highlights one of the things that makes using these tests tricky - understanding well what is actually being tested.
To be pragmatic - I am fairly sure that the SH test (and probably others) is implemented in the PAML package, and that PUZZLE (or TREE-PUZZLE, forget what it's called these days) does this too.