The use of any as opposed to every. This is a really basic question, but it is one I never really thought about until now. 
Let $\mathscr{G}$ be a tree. Then every pair of vertices in $\mathscr{G}$ is connected by a unique walk. 
We are asked to prove the converse which is worded as:
If any two vertices of  $\mathscr{G}$ are joined by a unique walk, then $\mathscr{G}$ is a tree. 
My question is whether the author means that if we can find a single pair of vertices that are joined by a unique walk in a graph (that may not be a tree), then we know $\mathscr{G}$ is a tree (which obviously is not true), or if he means something more a long the lines of "for all pairs of two vertices in $\mathscr{G}$". 
Similarly, he asks us to prove:
If $\mathscr{G}$ is connected but becomes disconnected by the removal of any one edge, then $\mathscr{G}$ is a tree. 
Again, in one case it is easy to find counterexamples of graphs with cycles (not trees) that can become disconnected by the removal of one of their edges, but if he wants us to prove that "if, for every edge, the removal of that edge will result in a disconnected graph, then the graph is a tree", the proof while also simple is very, very different. 
I come from a more applied background and am not used to this kind of wording. Any insight would be much appreciated.
 A: One problem with "any" is that, in mathematical English, it can mean either "there exists" or "for all". 
Some examples where "any" means "there exists":


*

*A number $\lambda$ is an eigenvalue of a matrix $A$ if any nonzero vector $x$ satisfies $(A-\lambda)x = 0$. 

*$X \cap Y$ is nonempty if any element of $X$ is an element of $Y$
Some examples where "any" means "for all":


*

*A set $A$ generates a group $G$ if any element $g \in G$ can be written as a product of elements of $A$. 

*A graph is connected if any two vertices are connected by a path. 
The result of this is that you have to use context or prior knowledge to read a mathematical sentence with "any" in it; there is not a general algorithm that will tell you how to read English. I generally advise my own students to avoid the word "any" until they are very comfortable with mathematical English. 
In the context of the question, if you state the converse as "If every pair of vertices of a graph is connected by a unique walk, then the graph is a tree", you can avoid the "any" issue altogether. 
A: Logically, they're the same: "For any $x$, $P(x)$" is the same as "For every $x$, $P(x)$" is the same as "$\forall x$, $P(x)$." Your initial inclination is correct.

There is, however, at least to my ear, a difference in connotation and hint of proof method. "For any" emphasizes that this property holds for an arbitrary element --- in your case, an arbitrary pair of vertices on the tree. Perhaps the proof will include the choice and consideration of an arbitrary object.
Meanwhile, "For every" emphasizes somehow some sort of "uniformity" --- perhaps the proposition can be proven from the properties of this class of object without choice of an arbitrary object.
But a note of caution: These are subtle connotations, certainly not definitions set in stone! Don't take them as gospel, but rather merely as one person's coloring of the language. They are two ways of phrasing the same logical quantifier.
A: According to the Oxford English Dictionary, "every" and "each" are both universal quantifiers, but "any" is not called a universal quantifier by the OED. 
Instead "any" is used to express qualitative force, i.e. emphasis. 
Unfortunately, careless usage has eroded these subtle distinctions. 
