3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
vector<int> L[200200];
vector<int> peso[200200];
int w[200200];
double ans;
int where = -1;
int block[200200];
int size[200200];
void dfs(int v, int p) {
  size[v] = 1;
  for (int i = 0; i < L[v].size(); i++)
    if (L[v][i] != p && !block[L[v][i]]) {
      dfs(L[v][i], v);
      size[v] += size[L[v][i]];
    }
}
double dfs2(int v, int p, int d) {
  double ret = sqrt(d) * w[v];
  for (int i = 0; i < L[v].size(); i++)
    if (L[v][i] != p) ret += dfs2(L[v][i], v, d + peso[v][i]);
  return ret;
}
double dfs3(int v, int p, int d) {
  double ret = sqrt(d) * d * w[v];
  for (int i = 0; i < L[v].size(); i++)
    if (L[v][i] != p) ret += dfs3(L[v][i], v, d + peso[v][i]);
  return ret;
}
void go(int v) {
  dfs(v, v);
  int tot = size[v];
  int pai = v;
  while (1) {
    int ok = 1;
    for (int i = 0; i < L[v].size(); i++)
      if (!block[L[v][i]] && L[v][i] != pai && size[L[v][i]] >= (tot + 1) / 2) {
        ok = 0;
        pai = v;
        v = L[v][i];
        break;
      }
    if (ok) break;
  }
  double big = 0, child = -1;
  for (int i = 0; i < L[v].size(); i++)
    if (!block[L[v][i]]) {
      double u = dfs2(L[v][i], i, peso[v][i]);
      if (u > big || child == -1) {
        big = u;
        child = i;
      }
    }
  double eval = dfs3(v, v, 0);
  if (where == -1 || eval < ans) {
    ans = eval;
    where = v;
  }
  if (child != -1) {
    block[v] = 1;
    go(L[v][child]);
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", w + i);
  for (int i = 0; i < n - 1; i++) {
    int a, b, p;
    scanf("%d%d%d", &a, &b, &p), a--, b--;
    L[a].push_back(b);
    L[b].push_back(a);
    peso[a].push_back(p);
    peso[b].push_back(p);
  }
  go(0);
  printf("%d %.10lf\n", where + 1, ans);
}
