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 nxt[200010 << 1], to[200010 << 1], w1[200010 << 1], head[200010], cnt;
void add(int u, int v, int w) {
  nxt[++cnt] = head[u];
  to[cnt] = v;
  w1[cnt] = w;
  head[u] = cnt;
}
int siz[200010], all, root, minr;
bool cut[200010];
void dfs(int u, int fa) {
  siz[u] = 1;
  int maxn = 0;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (cut[v] || v == fa) continue;
    dfs(v, u);
    siz[u] += siz[v];
    maxn = max(maxn, siz[v]);
  }
  maxn = max(maxn, all - siz[u]);
  if (maxn < minr) minr = maxn, root = u;
}
double sum, val[200010];
int num[200010];
void solve(int u, int fa, int s, int w) {
  sum += pow(w, 1.5) * num[u];
  val[s] += sqrt(w) * 1.5 * num[u];
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (v == fa) continue;
    solve(v, u, s, w + w1[i]);
  }
}
double ans = 1e18, res;
int id;
void work(int u, int sumsiz) {
  all = minr = sumsiz, root = 0;
  dfs(u, 0);
  u = root;
  dfs(u, 0);
  if (cut[u]) return;
  cut[u] = true;
  sum = res = 0;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    val[v] = 0;
    solve(v, u, v, w1[i]);
    res += val[v];
  }
  if (sum < ans) id = u, ans = sum;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (res >= val[v] * 2) continue;
    work(v, siz[v]);
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &num[i]);
  for (int i = 1; i < n; i++) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    add(u, v, w), add(v, u, w);
  }
  work(1, n);
  printf("%d %.10f\n", id, ans);
  return 0;
}
