public void decreaseD(int v, int newDValue) {
			
			if(leafs[v].cost > newDValue&&leafs[v].NoUpdateD==false){
				leafs[v].cost = newDValue;
				TreeNode n = leafs[v].parent;
				while(n!=null&&n.NoUpdateD==false&&n.cost > newDValue){
						n.cost = newDValue;
						n = n.parent;
				}
			}
			/*
			if(leafs[v].cost > newDValue){
				leafs[v].cost = newDValue;
				TreeNode n = leafs[v].parent;
				while(n!=null&&n.cost > newDValue){
						n.cost = newDValue;
						n = n.parent;
				}
			}*/
		
		}