Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology