1.25 英语翻译打卡

链接：Color a Tree | JXNUOJ

Bob is very interested in the data structure of a tree. A tree is a directed graph in which a special node is singled out, called the "root" of the tree, and there is a unique path from the root to each of the other nodes.
Bob intends to color all the nodes of a tree with a pen. A tree has N nodes, these nodes are numbered 1, 2, ..., N. Suppose coloring a node takes 1 unit of time, and after finishing coloring one node, he is allowed to color another. Additionally, he is allowed to color a node only when its father node has been colored. Obviously, Bob is only allowed to color the root in the first try.
Each node has a “coloring cost factor”, Ci. The coloring cost of each node depends both on Ci and the time at which Bob finishes the coloring of this node. At the beginning, the time is set to 0. If the finishing time of coloring node i is Fi, then the coloring cost of node i is Ci * Fi.
For example, a tree with five nodes is shown in Figure-1. The coloring cost factors of each node are 1, 2, 1, 2 and 4. Bob can color the tree in the order 1, 3, 5, 2, 4, with the minimum total coloring cost of 33.
   Bob对思维导图树非常感兴趣。一棵树是直接的图表，而且每个节点都是独立的，这叫做树的根。树根到每个节点都有独特的路径。

Bob打算给每个节点涂上颜色。一棵树有N个节点，每个节点都有序号1，2，3...N。涂完一个节点需要1个单位的时间。只有涂完上一个，才能图下一个。另外，只有当这个节点的上一个（母节点）被涂了，才能图这一个。显然，他只能从树根开始涂。每个节点有一个涂色费用变量，Ci 。涂色的费用取决于涂各个节点的时间和金钱。开始时间从0开始。如果完成i节点的时间是Fi,那么涂色费用是Ci*Fi。

例如，这棵树有5个节点如图一所示。每个涂色费用变量为1，2，1，2，4.Bob可以以1， 3 ，5，2，4的顺序涂节点。这会是最小的费用33。帮他算出最小的总费用。
Given a tree and the coloring cost factor of each node, please help Bob to find the minimum possible total coloring cost for coloring all the nodes.

输入：

The input consists of several test cases. The first line of each case contains two integers N and R (1 <= N <= 1000, 1 <= R <= N), where N is the number of nodes in the tree and R is the node number of the root node. The second line contains N integers, the i-th of which is Ci (1 <= Ci <= 500), the coloring cost factor of node i. Each of the next N-1 lines contains two space-separated node numbers V1 and V2, which are the endpoints（端点） of an edge(边) in the tree, denoting that V1 is the father node of V2. No edge will be listed twice, and all edges will be listed.
A test case of N = 0 and R = 0 indicates the end of input, and should not be processed.

第一行输入两个数N,R。N是树上的节点数，R是树根处的节点数。第二行输入N个数，表示Ci.(每个节点的费用)。接下来的几行 ，每行包括端点的序号V1,V2，以两个空格为间隔。V1,V2是某条边的端点,标志的V1是V2的母节点。每条边不能被列出两次，每个端点必须列出。以0  0结束输入。

输出：

For each test case, output a line containing the minimum total coloring cost required for Bob to color all the nodes.

对于每组测试数据，输出最小的总费用。