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;
int gi() {
  int res = 0, w = 1;
  char ch = getchar();
  while (ch != '-' && !isdigit(ch)) ch = getchar();
  if (ch == '-') w = -1, ch = getchar();
  while (isdigit(ch)) res = res * 10 + ch - '0', ch = getchar();
  return res * w;
}
const int MAX_N = 2e5 + 5;
vector<pair<int, int> > G[MAX_N];
int N, a[MAX_N];
int all, rmx, rt, sz[MAX_N];
bool used[MAX_N];
void dfs(int x, int fa) {
  int mx = 0;
  sz[x] = 1;
  for (auto e : G[x]) {
    int v = e.first;
    if (used[v] || v == fa) continue;
    dfs(v, x), sz[x] += sz[v];
    mx = max(mx, sz[v]);
  }
  mx = max(mx, all - sz[x]);
  if (mx < rmx) rmx = mx, rt = x;
}
double ans2 = 1e20, sum, d[MAX_N];
int ans1;
void calc(int x, int fa, int ds, int o) {
  sum += a[x] * pow(1.0 * ds, 1.5);
  d[o] += 1.5 * a[x] * pow(1.0 * ds, 0.5);
  for (auto e : G[x]) {
    int v = e.first, w = e.second;
    if (v == fa) continue;
    calc(v, x, ds + w, o);
  }
}
void Div(int x) {
  used[x] = 1;
  double sd = 0;
  sum = 0;
  for (auto e : G[x]) {
    int v = e.first;
    d[v] = 0;
    calc(v, x, e.second, v), sd += d[v];
  }
  if (sum < ans2) ans1 = x, ans2 = sum;
  for (auto e : G[x])
    if (sd - 2 * d[e.first] < 0) {
      if (!used[e.first]) {
        all = rmx = sz[e.first], dfs(e.first, x);
        Div(rt);
      }
      return;
    }
}
int main() {
  N = gi();
  for (int i = 1; i <= N; i++) a[i] = gi();
  for (int i = 1; i < N; i++) {
    int u = gi(), v = gi(), w = gi();
    G[u].push_back(make_pair(v, w));
    G[v].push_back(make_pair(u, w));
  }
  all = rmx = N, dfs(1, 0), Div(rt);
  printf("%d %0.9lf\n", ans1, ans2);
  return 0;
}
