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;
const int N = 200000 + 10;
int n;
int w[N], dis[N], sz[N];
bool ok[N];
double val[N];
vector<pair<int, int> > e[N];
void dfs_sz(int u, int p) {
  sz[u] = 1;
  for (auto it : e[u]) {
    int v = it.first;
    if (v == p || !ok[v]) continue;
    dfs_sz(v, u);
    sz[u] += sz[v];
  }
}
void find_gp(int u, int p, int x, int &mn, int &gp) {
  int tmp = x - sz[u];
  for (auto it : e[u]) {
    int v = it.first;
    if (v == p || !ok[v]) continue;
    find_gp(v, u, x, mn, gp);
    tmp = max(tmp, sz[v]);
  }
  if (mn > tmp) {
    mn = tmp;
    gp = u;
  }
}
void get_dis(int u) {
  for (auto it : e[u]) {
    int v = it.first, c = it.second;
    if (dis[v] != -1) continue;
    dis[v] = dis[u] + c;
    get_dis(v);
  }
}
double calc_ans(int u, int p) {
  double ret = dis[u] * sqrt(dis[u]) * w[u];
  for (auto it : e[u]) {
    int v = it.first;
    if (v == p) continue;
    ret += calc_ans(v, u);
  }
  return ret;
}
void calc_val(int u, int p) {
  val[u] = sqrt(dis[u]) * w[u];
  for (auto it : e[u]) {
    int v = it.first;
    if (v == p || !ok[v]) continue;
    calc_val(v, u);
    val[u] += val[v];
  }
}
void ShuFanZhi(int u, int &bestv, double &ans) {
  fill(sz, sz + n + 1, -1);
  dfs_sz(u, u);
  int gp = u, mn = sz[u];
  find_gp(u, u, sz[u], mn, gp);
  ok[gp] = false;
  fill(dis, dis + n + 1, -1);
  dis[gp] = 0;
  get_dis(gp);
  double tmp = calc_ans(gp, gp);
  if (bestv == -1 || tmp < ans) {
    ans = tmp;
    bestv = gp;
  }
  calc_val(gp, gp);
  int nxt = -1;
  for (auto it : e[gp]) {
    int v = it.first;
    if (!ok[v]) continue;
    if (nxt == -1 || val[v] > val[nxt]) nxt = v;
  }
  if (nxt != -1) ShuFanZhi(nxt, bestv, ans);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", w + i);
  for (int i = 0; i < n - 1; i++) {
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    e[a].push_back(make_pair(b, c));
    e[b].push_back(make_pair(a, c));
  }
  double ans;
  int bestv = -1;
  fill(ok, ok + n + 1, true);
  ShuFanZhi(1, bestv, ans);
  printf("%d %.10f\n", bestv, ans);
  return 0;
}
